TweetFollow Us on Twitter

Jan 97 Challenge

Volume Number: 13 (1997)
Issue Number: 1
Column Tag: Programmer's Challenge

Programmer's Challenge

By Bob Boonstra, Westford, MA


The theme of this issue of the magazine is the Be Operating System, so it seemed appropriate to focus the Challenge on the BeOS, and give you a chance to use the BeOS for Macintosh CD-ROM bundled in this issue. Since the BeOS will be new to most of you, this Challenge will be a simple one. The problem is to write a window class that will display and sort a list of strings by one of three specified methods: a bubble sort, an exchange sort, and an algorithm of your choosing. The prototype for the class you should write is

typedef enum SortType {
 kBubbleSort = 1,
 kExchangeSort = 2,
 kMySort = 3
} SortType;

class SortWindow : public BWindow {

 SortWindow(BRect frame); 
virtual void   DoSort(
 char *thingsToSort[],  /* list of strings to sort, also returns sorted list */
 int numberOfThings, /* number of thingsToSort */
 SortType sortMethod);  /* sort method to use */

My test code will open three instances of your window class and ask each one to sort a copy of the same list of strings: one by the kBubbleSort method, one by kExchangeSort, and one by kMySort. Your SortWindow constructor should create a BListView and attach it to your SortWindow. When the DoSort method is invoked, you should display the thingsToSort and sort them into ascending ASCII order by the sortMethod algorithm. Each time two thingsToSort are exchanged, the BListView display should be updated. When the sort is complete, DoSort should post a B_QUIT_REQUESTED message to the application. The list should be sorted in place and returned in thingsToSort.

This will be a native PowerPC Challenge, using the latest Macintosh CodeWarrior environment, targeted for the BeOS. Solutions must be coded in C++. The code will be tested on my 8500 using the BeOS. (In the event I cannot get the BeOS to run on my Mac, I will run the tests on a 2x133MHz BeBox with one processor disabled.) The winner will be the solution that completes all three sorts correctly in the minimum time.

Three Months Ago Winner

Congratulations to Andy Antoniewicz (Mountain View, CA) for narrowly beating second and third place finishers Greg Cooper and Ludovic Nicolle in the October DNA Match Challenge. Of the fifteen entries I received for this Challenge, ten worked completely correctly, two were partially correct, and the remaining three crashed my machine.

Recall that the DNA Match Challenge was essentially a string matching problem, where the strings were allowed to differ in a specified number of positions (or fewer). The object was to return the number of near matches of a fragment string found in a reference database string.

My intent had been to test the solutions submitted using very long database strings. The run times of the solutions imposed a practical limit of about 2 MB on the size of the database string in an individual test case. The fragments to be matched were all significantly shorter than the database string, as indicated in the problem statement. The tests ranged from requiring very accurate matches, with a small value for the number of differences allowed, to approximate matches that could differ in up to half of the characters in the reference string.

The problem statement allowed for a timed initialization routine that would be executed once prior to testing matches against multiple fragments for a given database string. None of the top-ranked solutions made any significant use of this option, although a number of people used it to initialize small translation tables. Several people commented that it was difficult to find a use for this initialization routine, when the scratch storage provided was smaller than the maximum size database string.

Andy's winning entry parses the fragment string to create, for each character in the DNA "alphabet", a list of offsets where that character is located in the fragment. He then walks the database string and increments a match counter for each possible alignment of the fragment that matches the database at that character position. Andy uses a circular buffer twice the size of the fragment to store the match counts, which allows him to perform bounds checking on that buffer only once per database character, rather than within the innermost character matching loop. I had to read the code several times and run through a few cases manually before the light went on and I understood the algorithm, after which I found it quite clever.

While A.C.C. Murphy's solution did not place in the top five, one of his algorithms used a refinement worthy of note. He kept a running total of the counts of characters in a fragment-sized segment of the database, only checking for a specific match if the frequency counts were close enough to those of the fragment. In test cases where the character frequencies of the fragment were significantly different than much of the database, this technique might have done very well.

The table below summarizes the results for each correct or partially correct entry, including total execution time for all of the test cases and code size. Numbers in parenthesis after a person's name indicate that person's cumulative point total for all previous Challenges, not including this one. An asterisk indicates a result that was partially correct and therefore not eligible to win.

NameLanguageTotal TimeCode Size
Andy Antoniewicz (4)C123823728
Greg Cooper (17)C126233872
Ludovic Nicolle (14)C126646528
Michael Panchenko (6)C148243800
Bjorn Davidsson (4)C149171424
A.C.C. Murphy (10)C1510861800
Ernst Munter (224)C++176521752
Peter Lewis (32)C195312240
Mark DayC197385848
Larry Landry (29)C2671181376
Alan Hart (*)C210701848
Xin Xu (*)C2230151576


Here are the Top 20 Contestants for the Programmer's Challenge. The numbers below include points awarded over the 24 most recent contests, including points earned by this month's entrants.

1.Munter, Ernst193
2.Gregg, Xan114
3.Larsson, Gustav87
4.Lengyel, Eric40
5.[Name deleted]40
6.Lewis, Peter32
7.Boring, Randy27
8.Cooper, Greg27
9.Antoniewicz, Andy24
10.Beith, Gary24
11.Kasparian, Raffi22
12.Cutts, Kevin21
13.Nicolle, Ludovic21
14.Picao, Miguel Cruz21
15.Brown, Jorg20
16.Gundrum, Eric20
17.Karsh, Bill19
18.Stenger, Allen19
19.Mallett, Jeff17
20.Nevard, John17

There are three ways to earn points: (1) scoring in the top 5 of any Challenge, (2) being the first person to find a bug in a published winning solution or, (3) being the first person to suggest a Challenge that I use. The points you can win are:

1st place20 points
2nd place10 points
3rd place7 points
4th place4 points
5th place2 points
finding bug2 points
suggesting Challenge2 points

Here is Andy's winning solution:


© 1996 Andy Antoniewicz

DNA string match with wildcard & constant distance

No setup calculations on the database are performed. It seemed kind of pointless to attempt the equivalent 
of a 50 to 1 loss, less compression of the database ( it was 1000 to 1 for the first problem statement ).

This is a simple and quick single byte per pass index and count type algorithm. It uses three tables: a byte 
to code index table "aTable", a fragment index list array "alphaList",
and a hit count circular array "matchQueue". A precursor list is built and used once to build the alphaList 
array, and I do not clean up after (plenty of allocated storage).
Once built, the aTable contains an index into the alphaList for each given alphabet letter in the fragment. 
The alphaList contains a sequential list of all occurrences of that character in the fragment string.

The algorithm then increments the match count for all possible alignments of the fragment for each database 
character. Since the maximum misalignment is less than the fragment size, only the previous fragmentSize 
database characters need to be considered for matches at any particular time. Hence the circular queue 

The database search execution time is order( pN ) where N = number of database characters
p = average fragment entries per alphabet char 
( for example: A=3,C=3,G=2,T=2 -
> p = 2.5 )
The storage used is almost totally dependent on the fragment size. Storage used in bytes
    = 20     ( storage struct )
    + 256         ( 16bit aTable )
    + 2 * fragment chars( 16bit precursor )
    + 2 * fragment chars( 16bit alphaList )
    + 2 * alphabet chars (  more alphaList )
    + 4 * fragment chars( 2x16bit matchQueue )

 ********* ********* ********* ********* ********* ********/
#define kAlphaTableSize   128
#define kEndOfAlphaList   -1
typedef struct {
 long storageSize; // total storage available
 long usedStorage; // total storage used
 long fragmentSize;// size in chars of fragment
 short  *alphaList;// start of fragment index list
 short  *matchQueue; // start of match count queue
 short  alphaTable[ kAlphaTableSize ];
 short  precursor[]; // start of match count queue
} DNAStore;

/********* ********* ********* ********* ********* ********
 Function Prototypes
 ********* ********* ********* ********* ********* ********/

void InitMatch(
 char *alphabet, // legal characters in database
 char *database, // the reference database
 void *storage,  // pre-allocated storage
 long storageSize// size of storage in bytes

long FindMatch(  // return number of matches
 char *alphabet, // legal characters in database
 char *database, // the reference database
 void *storage,  // pre-allocated storage
 char *fragment, // the fragment to find
 long diffsAllowed,// num of diffs allowed between
    //  a "match" and the database
 long matchPosition[]// match return array

void BuildAlphaList(
 char   *alphabet, // legal characters in database
 char   *fragment, // the fragment to find; 0 term
 DNAStore *storage // my storage area

/********* ********* ********* ********* ********* ********
 * InitMatch
 * This routine does nothing except to store the
 *  size of memory allocated by the calling program.
 * All of the structures used are based on the fragment
 * to be searched for.
 ********* ********* ********* ********* ********* ********/

void InitMatch(
 char *alphabet, // legal characters in database
 char *database, // the reference database
 void *storage,  // pre-allocated storage
 long storageSize// size of storage in bytes
 ((DNAStore*)storage)->storageSize = storageSize;
}// end of InitMatch

/********* ********* ********* ********* ********* ********
 * BuildAlphaList
 * This routine has three parts:
 * Build the AlphaTable
 * The AlphaTable is an index table used to find
 * the start location inside the AlphaList
 * that corresponds to the given alphabet
 * character.
 * Build the AlphaList precursor
 * This is a linked list of the indexes to each
 * character in the fragment. It is used once
 * to build the AlphaList and never re-used.
 * Build the AlphaList
 * This is a sorted list of indexes for each
 * alphabet character. The head of each list is
 * stored in the AlphaTable, and each list is
 * ended by a -1.
 ********* ********* ********* ********* ********* ********/

void BuildAlphaList(
 char   *alphabet, // legal characters in database
 char   *fragment, // the fragment to find; 0 term
 DNAStore *storage // my storage area
 short  *aTable; // ptr in the AlphaTable
 short  *precursor;// the AlphaList precursor
 short  *alphaList;// the AlphaList

 char *aString;  // ptr to a character string
 long aChar;// a character from a string
 long count;
 short  index;

     * Initialize alphabet entries to kEndOfAlphaList
     *     Proper function for characters not in the alphabet
     *     requires that the other entries be preset to zero.
     *     This is automatic if the storage is cleared by
     *     the calling program and if the alphabet does not
     *     change between calls to InitMatch.
 aTable = storage->alphaTable;
 aString = alphabet - 1;
 while( (aChar = (long)(*(++aString)) ) > 0x00 )
 *(aTable+aChar) = kEndOfAlphaList;
     * Build precursor linked index list
     *     This list is only used to produce the 
     *     AlphaList below. The precursor and
     *     the AlphaList are rebuilt for each
     *     new fragment that will be searched for.
 precursor= storage->precursor;
 aString= fragment - 1;
 index  = 0;
 count  = 0;
 while( (aChar = (long)(*(++aString))) > 0x00 )
 index = *(aTable+aChar); // get prev head
 *(aTable+aChar) = count; // put new head
 *(precursor+count) = index;// store prev head
 storage->fragmentSize = count;
     * Build AlphaList
     *     by walking each alphabet character's precursor 
     *     list and writing the index list into the 
     *     AlphaList the algorithm gets a sorted list of
     *     indexes into the fragment for each letter in the
     *     alphabet. The aTable will point to the first entry
     *     in the AlphaList and the last entry of each 
     *     character list is equal to the constant 
     *     kEndOfAlphaList ( = -1 ). Note that AlphaList
     *     location 0 is used to ignore database characters
     *     which are not in the given alphabet (it was free).
 alphaList = precursor + count;
 *(alphaList) = kEndOfAlphaList;
 aString = alphabet - 1;
 count = 1;
 while( (aChar = (long)(*(++aString)) ) > 0x00 )
 index = *(aTable+aChar);
 *(aTable+aChar) = count;
 while( index != kEndOfAlphaList )
 *(alphaList+count) = index;
 index = *(precursor+index);
 *(alphaList+count) = kEndOfAlphaList;
 storage->alphaList= alphaList;
 storage->matchQueue = alphaList + count + 1;
}// end of BuildAlphaList

/********* ********* ********* ********* ********* ********
 * FindMatch
 * For each character in the database increment every
 * match count that has the same character ( a hit ).
 * If after all possible alignments have been tallied,
 * the match count is greater than or equal to the value
 * of the threshold, then a match has been found.
 * Add the matching entry to the return array and continue
 * until all database characters have been tested.
 ********* ********* ********* ********* ********* ********/

long FindMatch(  // return number of matches
 char *alphabet, // legal characters in database
 char *database, // the reference database
 void *storage,  // pre-allocated storage
 char *fragment, // the fragment to find
 long diffsAllowed,// num of diffs allowed between
    //  a "match" and the fragment
 long matchPosition[]// match return array
 DNAStore *theStore; // typed storage
 short  *matchTop; // top of match array
 short  *matchCur; // current match array entry
 short  *aTable; // alpha to aList index table
 short  *aList;  // array of hit offsets
 short  *hitOffset;// current hit offset entry
 char   *dbString; // current database char entry
 long   dbChar;  // current database character
 long   count;   // current database location
 long   numMatch;// number of matches found
 long   fragSize;// fragment size in bytes
 long   loop;    // loop counter
 long   hitPos;  // current hit offset position
 long   threshold; // the threshold for matching
 theStore = (DNAStore*)storage;
 BuildAlphaList( alphabet,fragment,theStore);
 fragSize = theStore->fragmentSize;
 matchTop = theStore->matchQueue;
 matchCur = matchTop + fragSize;
 = (long)(matchCur+fragSize)-(long)theStore;
     * Clear the Match Count Array
     *     clear out the match counts for the entire array
 for( count=0; count<fragSize; count++ )
 *(matchCur+fragSize) = 0;
 *matchCur- = 0;

     * Walk the Database
     *    The match count array is a double size circular
     *    queue of match counts. It is double size so I do
     *    not need to check the array bounds in the inner
     *    match count increment loop.
 dbString = database - 1;
 aTable = theStore->alphaTable;
 aList = theStore->alphaList;
 threshold = fragSize-diffsAllowed;

 numMatch = 0;
 count = -fragSize;// count = current database loc.
 while( (dbChar = (long)(*(++dbString))) > 0x00 )
    // circular queue reset to center
 if( matchCur == matchTop )
 matchCur += fragSize;
    // check for a match to the fragment
 if((*matchCur+*(matchCur+fragSize)) >= threshold )
 matchPosition[ numMatch ] = count;
    // clear both old counts
 *matchCur = 0;
 *(matchCur+fragSize) = 0;

    // increment match counts for all possible
    //     fragment alignments
 hitOffset = aList + *(aTable + dbChar) - 1;
 while( (hitPos = (long)(*(++hitOffset))) >= 0 )
 *(matchCur + hitPos ) += 1;
    // The match count queue is walked in reverse
    //     order through memory because the alphaList
    //     indexes are positive.
     * Check the remaining match count entries for
     *    any fragments that extend beyond the end of
     *    the database.
 for( loop=0; loop < diffsAllowed; loop++)
 if( matchCur == matchTop )
 matchCur += fragSize;
 if((*matchCur+*(matchCur+fragSize)) >= threshold )
 matchPosition[ numMatch ] = count;
    // end of DNA_Match.c


Community Search:
MacTech Search:

Software Updates via MacUpdate

calibre 2.17 - Complete e-library manage...
Calibre is a complete e-book library manager. Organize your collection, convert your books to multiple formats, and sync with all of your devices. Let Calibre be your multi-tasking digital librarian... Read more
OmniGraffle Pro 6.1.2 - Create diagrams,...
OmniGraffle Pro helps you draw beautiful diagrams, family trees, flow charts, org charts, layouts, and (mathematically speaking) any other directed or non-directed graphs. We've had people use... Read more
OmniGraffle 6.1.2 - Create diagrams, flo...
OmniGraffle helps you draw beautiful diagrams, family trees, flow charts, org charts, layouts, and (mathematically speaking) any other directed or non-directed graphs. We've had people use Graffle to... Read more
RoboForm 2.0.2 - Password manager; syncs...
RoboForm is a password manager that offers one-click login, mobile syncing, easy form filling, and reliable security. Password Manager. RoboForm remembers your passwords so you don't have to! Just... Read more
Apple MainStage 3.1 - Live performance t...
Love the sound you got on your recording? MainStage 3 makes it easy to bring all the same instruments and effects to the stage. Everything from the Sound Library and Smart Controls you're familiar... Read more
Freeway Pro 7.0.2 - Drag-and-drop Web de...
Freeway Pro lets you build websites with speed and precision... without writing a line of code! With its user-oriented drag-and-drop interface, Freeway Pro helps you piece together the website of... Read more
A Better Finder Rename 9.44 - File, phot...
A Better Finder Rename is the most complete renaming solution available on the market today. That's why, since 1996, tens of thousands of hobbyists, professionals and businesses depend on A Better... Read more
Stacks 2.6.9 - New way to create pages i...
Stacks is a new way to create pages in RapidWeaver. It's a plugin designed to combine drag-and-drop simplicity with the power of fluid layout. Features: Fluid Layout: Stacks lets you build pages... Read more
Sid Meier's Civilization: Beyond Ea...
Sid Meier's Civilization: Beyond Earth is a new science-fiction-themed entry into the award-winning Civilization series. Set in the future, global events have destabilized the world leading to a... Read more
Logic Pro X 10.1 - Music creation and au...
Apple Logic Pro X is the most advanced version of Logic ever. Sophisticated new tools for professional songwriting, editing, and mixing are built around a modern interface that's designed to get... Read more

Choice Provisions is Set to Launch Destr...
Choice Provisions is Set to Launch Destructamundo on iOS This Month Posted by Tre Lawrence on January 23rd, 2015 [ permalink ] Choice Provisions – home stable to | Read more »
King of Thieves – An Interview With Zept...
Ahead of the release of ZeptoLab’s King of Thieves, we were able to ask ZeptoLab’s co-founder, Semyon Voinov, a few questions about the inspiration behind the game and what that means for the Cut the Rope franchise. | Read more »
Handle Review
Handle Review By Jennifer Allen on January 23rd, 2015 Our Rating: :: SPEEDY ORGANIZINGUniversal App - Designed for iPhone and iPad Handle is a very convenient way of juggling your emails, To Do list, and Calendar all through one... | Read more »
The New Disney Inquizitive App Offers a...
The New Disney Inquizitive App Offers a Place for Fans to Take Disney Quizzes Posted by Tre Lawrence on January 23rd, 2015 [ permalink ] | Read more »
Hands-On With Cut the Rope Developer Zep...
Marking quite a departure from ZeptoLab’s past successes, namely the Cut The Rope series, King of Thieves is shaping up to be quite promising. Due for release in February, we were lucky enough to have some time with a preview build to see exactly... | Read more »
Fast Fishing Review
Fast Fishing Review By Jennifer Allen on January 23rd, 2015 Our Rating: :: LIVES UP TO ITS NAMEUniversal App - Designed for iPhone and iPad Fishing is far from relaxing in Fast Fishing, but it is fun.   | Read more »
The LEGO Movie Video Game is Available N...
The LEGO Movie Video Game is Available Now for iOS Posted by Ellis Spice on January 23rd, 2015 [ permalink ] Universal App - Designed for iPhone and iPad | Read more »
Satellina Review
Satellina Review By Jennifer Allen on January 23rd, 2015 Our Rating: :: TWITCHY BUT TACTICALUniversal App - Designed for iPhone and iPad Satellina requires quick thinking and twitchy fingers, and it’s pretty fun.   | Read more »
Tail Drift, the Crazy 360 Degree Flyer,...
Tail Drift, the Crazy 360 Degree Flyer, Has Gone Free-to-Play in a New Update Posted by Jessica Fisher on January 22nd, 2015 [ permalink ] | Read more »
PureSkate 2 Review
PureSkate 2 Review By Tre Lawrence on January 22nd, 2015 Our Rating: :: ALMOST ALL AIRUniversal App - Designed for iPhone and iPad PureSkate 2 lets one’s fingers do the skateboarding.   | Read more »

Price Scanner via

College Student Deals are back, additional $5...
Take an additional $50 off all MacBooks and iMacs at Best Buy Online with their College Students Deals Savings, valid through April 11, 2015. Anyone with a valid .EDU email address can take advantage... Read more
iPhone 6 and 6 Plus GIve Apple Half Of US Mob...
Chicago-based Consumer Intelligence Research Partners, LLC (CIRP) have released analysis of the results of its research on mobile phone manufacturers for the calendar quarter that ended December 31,... Read more
Save $100 on MacBook Airs with 256GB of stora...
B&H Photo has 256GB MacBook Airs on sale for $100 off MSRP. Shipping is free, and B&H charges NY sales tax only: - 11″ 1.4GHz/256GB MacBook Air: $999 $100 off MSRP - 13″ 1.4GHz/256GB MacBook... Read more
21-inch 2.7GHz iMac on sale for $1179, save $...
B&H Photo has the 21″ 2.7GHz iMac on sale for $1179 including free shipping plus NY sales tax only. Their price is $120 off MSRP, and it’s the lowest price available for this model from any... Read more
iPhone Usage Rates by State Correlate With Ed...
Chitika Insights notes that despite iPhones being the largest source of smartphone Internet traffic in North America, their latest study finds a relatively high degree of variation of iPhone usage... Read more
ProGearX Extendable Pole “Pov/Selfie Stick” M...
There’s something inescapably narcissistic about the concept of selfies as they’ve developed as a smartphone-driven social (particularly social media) phenomenon that rubs me the wrong way. However,... Read more
iPad Air 2 on sale for up to $100 off MSRP, 2...
 Best Buy has iPad Air 2s on sale for up to $100 off MSRP on their online store for the next two days. Choose free shipping or free local store pickup (if available). Sale prices available for online... Read more
Roundup of Apple refurbished MacBook Pros and...
The Apple Store has Apple Certified Refurbished 2014 MacBook Pros and MacBook Airs available for up to $400 off the cost of new models. An Apple one-year warranty is included with each model, and... Read more
Sale! 13-inch 2.8GHz Retina MacBook Pro for $...
 B&H Photo has the 13″ 2.8GHz Retina MacBook Pro on sale for $1599 including free shipping plus NY sales tax only. Their price is $200 off MSRP, and it’s the lowest price available for this model... Read more
Next OS X/iOS Version Upgrades Should Concent...
On stage at Apple’s World Wide Developers’ Conference in June 2009, Bertrand Serlet, the company’s Senior Vice President of Software Engineering at the time, announced that the forthcoming OS X... Read more

Jobs Board

Business Development Manager - *Apple* Pay...
**Job Summary** Apple Pay is seeking an experienced business development manager to support the identification, recruitment, negotiation and ongoing management of Read more
*Apple* Solutions Consultant (ASC)- Retail S...
**Job Summary** The ASC is an Apple employee who serves as an Apple brand ambassador and influencer in a Reseller's store. The ASC's role is to grow Apple Read more
*Apple* Solutions Consultant - Retail Sales...
**Job Summary** As an Apple Solutions Consultant (ASC) you are the link between our customers and our products. Your role is to drive the Apple business in a retail Read more
*Apple* Lead Operator, GSOC - Apple (United...
**Job Summary** Apple is seeking an exceptional, customer service oriented and experienced persons to fulfill the role of Apple Lead Operator (ALO) as part of the Read more
Order Support Supervisor- *Apple* Online Sto...
**Job Summary** The Apple Online Store (AOS) Order Administration team is looking for an Order Support Supervisor to manage and lead a team of Specialists through the Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.