TweetFollow Us on Twitter

Apr 94 Challenge
Volume Number:10
Issue Number:4
Column Tag:Programmers’ Challenge

Related Info: Memory Manager

Programmers’ Challenge

By Mike Scanlin, MacTech Magazine Regular Contributing Author

Note: Source code files accompanying article are located on MacTech CD-ROM or source code disks.

The rules

Here’s how it works: Each month there will be a different programming challenge presented here. First, you must write some code that solves the challenge. Second, you must optimize your code (a lot). Then, submit your solution to MacTech Magazine (formerly MacTutor). A winner will be chosen based on code correctness, speed, size and elegance (in that order of importance) as well as the postmark of the answer. In the event of multiple equally desirable solutions, one winner will be chosen at random (with honorable mention, but no prize, given to the runners up). The prize for the best solution each month is $50 and a limited edition “The Winner! MacTech Magazine Programming Challenge” T-shirt (not to be found in stores).

In order to make fair comparisons between solutions, all solutions must be in ANSI compatible C (i.e., don’t use Think’s Object extensions). Only pure C code can be used. Any entries with any assembly in them will be disqualified (except for those challenges specifically stated to be in assembly). However, you may call any routine in the Macintosh toolbox you want (i.e., it doesn’t matter if you use NewPtr instead of malloc). All entries will be tested with the FPU and 68020 flags turned off in THINK C. When timing routines, the latest version of THINK C will be used (with ANSI Settings plus “Honor ‘register’ first” and “Use Global Optimizer” turned on) so beware if you optimize for a different C compiler. All code should be limited to 60 characters wide. This will aid us in dealing with e-mail gateways and page layout.

The solution and winners for this month’s Programmers’ Challenge will be published in the issue two months later. All submissions must be received by the 10th day of the month printed on the front of this issue.

All solutions should be marked “Attn: Programmers’ Challenge Solution” and sent to Xplain Corporation (the publishers of MacTech Magazine) via “snail mail” or preferably, e-mail - AppleLink: MT.PROGCHAL, Internet: progchallenge@xplain.com, CompuServe: 71552,174 and America Online: MT PRGCHAL. If you send via snail mail, please include a disk with the solution and all related files (including contact information). See page 2 for information on “How to Contact Xplain Corporation.”

MacTech Magazine reserves the right to publish any solution entered in the Programming Challenge of the Month and all entries are the property of MacTech Magazine upon submission. The submission falls under all the same conventions of an article submission.

SWAP BLOCKS

This month’s challenge is to swap two adjacent blocks of memory using a finite amount of temporary swap space. This is something the Memory Manager has to do quite often as it shuffles blocks around in the heap.

The prototype of the function you write is:


/* 1 */
void SwapBlocks(p1, p2, swapPtr size1,
  size2, swapSize)
void    *p1;
void    *p2;
void    *swapPtr;
unsigned long  size1;
unsigned long  size2;
unsigned long  swapSize;

p1 and p2 point to the beginnings of the two blocks to swap. size1 and size2 are their respective sizes (in bytes). Both blocks begin on addresses divisible by 4 and have sizes that are divisible by 4. swapPtr points to the scratch area you can use (if you need to) and swapSize is the size of that area (between 256 and 4096 bytes, inclusive). swapPtr and swapSize are also each divisible by 4. If the two blocks look like this on entry:


/* 2 */
12345678ABCDEFGHIJKL
^       ^
p1      p2    size1 = 8   size2 = 12

then the same memory locations will look like this on exit:


/* 3 */
ABCDEFGHIJKL12345678

When measuring performance I will be calling your routine many times. The distribution of the sizes of the blocks is as follows:

4 to 16 bytes 20% of the time

20 to 32 bytes 20% of the time

36 to 64 bytes 20% of the time

68 to 256 bytes 20% of the time

260 to 4096 bytes 10% of the time

4100 or more bytes 10% of the time

You would normally write this kind of routine in assembly, but let’s see how well you can do in pure C (remember, everyone has the same handicap). If you want to submit a pure assembly solution along with your pure C solution then please do so (but the assembly version will NOT be counted as an entry in the challenge and it will not win anything other than a mention in this column).

TWO MONTHS AGO WINNER

Of the 11 entries I received for the We Pry Any Heap (Happy New Year) anagram challenge, only 5 worked correctly. Congrats to Larry Landry (Rochester, NY) for the dual honor of coming in 1st both in terms of speed and smallest code size.

The times for anagramming “programmer” (462 anagrams) and “mactech magazine” (3365 anagrams) with a 19,335 word English dictionary are given here (more weight was given to longer inputs (15-30 characters) when ranking contestants). Numbers in parens after a person’s name indicate how many times that person has finished in the top 5 places of all previous Programmer Challenges, not including this one:

Name code time 1 time 2

Larry Landry (1) 830 20 1048

Stepan Riha (5) 2352 45 1166

Bob Boonstra (6) 1370 52 1688

Allen Stenger (3) 1044 23 1701

Mark Nagel 1134 81 51407

Most of the entrants figured out that the key to speeding up the anagram process was to pare down the size of the dictionary first. Once you have the input characters you can eliminate any word in the dictionary that: (1) contains more characters than the input, (2) contains at least one letter not in the input set or, (3) contains more of any particular character than the input. For instance, if your input is “programmer” then you can remove any word in the dictionary that (1) is more than 10 characters long, (2) is not made up entirely of the letters [p, r, o, g, a, m, e] and, (3) contains more than any one of: 1 p, 3 r’s, 1 o, 1 g, 1 a, 2 m’s, or 1 e.

Stepan Riha (Austin, TX) took this “reduce the dictionary” idea one step further and came up with a way to store words that are permutations of each other (like ‘stop’, ‘post’ and ‘pots’) as one entry in the dictionary (and when it’s time to output an anagram he outputs all permutations for each word in the output).

Several people wrote to me and asked if reordering the words in each output anagram was necessary (i.e. ‘pale rain’ and ‘rain pale’). I admit that it wasn’t clear in the puzzle specification exactly what qualified as a ‘unique’ anagram so I allowed either interpretation. The only one of the 5 correct entries that did count word reorderings as unique anagrams is Mark Nagel (Irvine, CA) and his times above reflect that fact.

Here’s Larry’s winning solution:

Anagram Programmer's Challenge

by Larry Landry

This implementation uses a large amount of memory to optimize the CPU utilization. To guarantee that we have enough memory for all matching words, we actually allocate an array of pointers for 30,000 words. Since the rules stated that there would be about 20,000 words in the dictionary, even if every word matched, we would still have enough storage. In reality this number could probably be less than 1-200 for all but the most rare of scenarios.

The basic algorithm is: 1) Convert the input string into a table of counts for each character from a-z. So "sammy" would have a count of 2 for "m" and 1 for each of "s", "a", and "y". This makes testing for the presence of a character as simple as checking and indexed value in an array. 2) Parse through the dictionary and find the words that can be composed of some portion of characters from the input characters. Build a list of pointers to each word. The number of words in this list will be in the tens instead of thousands. 3) Recursively process the words in this list and find strings of words that use up all of the characters. For each matching sequence, output the words to the file. The processing required by this algorithm is then

D * C1 + M * log2(M) * C2

where

D = size of input dictionary

M = number of matching words

C1 & C2 are constants

This algorithm works very well for cases where there are few words that match the input letters. The worst case scenario where all words can be made from the input letters will still take a very long time. I expect that matching words will typically be less than 100.


/* 4 */
#include   <stdio.h>

typedef unsigned char   uchar;
typedef unsigned short ushort;
typedef unsigned long  ulong;

#define MAX_WORDS   30000L
#define OUTPUT_BUFFER_SIZE  10000L
#define RETURN  '\n'

typedef struct {
   char*fWordStart;
   short   fWordLength;
} WordLoc;

/* Usage counts for each character (only indexes 'a' to 'z' are actually 
used) */
typedef uchar   CharData[256];

unsigned long Anagram(Str255 inputText, FILE *wordList,
   FILE *outputFile);

ulong findInputWords(register char *wordBuffer,
   WordLoc *validWords);
ulong findAnagrams(short numValidChars, ulong wordCount,
   WordLoc *validWords, short prevWordCount);

/* I use some global variables here to avoid passing them down into the 
recursive routine findAnagrams().  These values are constant once findAnagrams() 
is called. */

char     gOutputBuffer[OUTPUT_BUFFER_SIZE];
char    *gOutputBufferEnd = gOutputBuffer + 
 OUTPUT_BUFFER_SIZE - 512;
char    *gOutputPtr;
CharData  gValidChars;
WordLoc  *gWordsInUse[255];
FILE    *gOutputFile;

unsigned long Anagram(Str255 inputText, FILE *wordList,
   FILE *outputFile)
{
   fpos_t  wordBufferLength;
   char*  wordBuffer;
   short   index;
   short   numValidChars;
   WordLoc validWords[MAX_WORDS];
   char   ch;
   ulong   wordCount;

   gOutputFile = outputFile;
   gOutputPtr = gOutputBuffer;

/* To save on file I/O time, read the whole file all at once.  First, 
find the length of the file by seeking the end and finding the file pos. 
 Then allocate a buffer of that size, plus 2 bytes  (for a return and 
NULL char) and read the data into it.  Finally put the return and NULL 
char at the end. */

   fseek(wordList, 0L, SEEK_END);
   fgetpos(wordList, &wordBufferLength);
   wordBuffer = (char*) NewPtr((Size) wordBufferLength + 2);
   if (wordBuffer == NULL)
   return 0L;  /* real error handling here */
   rewind(wordList);
   fread(wordBuffer, (size_t) 1,
   (size_t) wordBufferLength, wordList);
   if (wordBuffer[wordBufferLength-1] != RETURN)
   wordBuffer[wordBufferLength++] = RETURN;
   wordBuffer[wordBufferLength] = '\0';

/* To save time ruling out words, we build a list of the valid characters 
in the words.  We start with no valid characters. */
   for (index='a'; index<'z'; index++)
   gValidChars[index] = 0;

/* Now build the list of valid characters.  Each array entry will be 
a count of how many times that character is present. */
   numValidChars = *inputText++;
   for (index=numValidChars; index>0; index--)
   if ((ch = *inputText++) != ' ')
   gValidChars[ch]++;
   else
   numValidChars--;
/* Find the list of words that can be made up from the letters in the 
input word */
   wordCount = findInputWords(wordBuffer,
 &validWords[MAX_WORDS-1]);
/* Now find the list of full anagrams that can be created from these 
words */
   wordCount = findAnagrams(numValidChars, wordCount,
   &validWords[MAX_WORDS-wordCount], 0);
/* Write the results to the output */
   *gOutputPtr = 0;/* Terminate the string */
   fprintf(outputFile, gOutputBuffer);
   DisposPtr(wordBuffer);
   return wordCount;
} /* Anagram */


ulong findInputWords(register char *wordBuffer,
   WordLoc *validWords)
{
   char*saveStart = wordBuffer;
   ulong   numberWords = 0;
   char ch;

   while (*wordBuffer)
   {
   ch = *wordBuffer++;
   if (ch == RETURN)
   {
/* Record this entry as a valid word */
   numberWords++;
   validWords->fWordStart = saveStart;
   validWords->fWordLength = (short)(wordBuffer -
   saveStart - 1);
   validWords--;

   wordBuffer--;
   while (saveStart < wordBuffer)
 gValidChars[*saveStart++]++;

/* Save the new start of word pointer */
   saveStart = ++wordBuffer;
   } else if (gValidChars[ch])
   gValidChars[ch]--;
   else
   {
/* This word didn't match so reset and go to the next word */
   wordBuffer--;
   while (saveStart < wordBuffer)
   gValidChars[*saveStart++]++;
   while (*wordBuffer++ != RETURN)
   ;
/* Save the new start of word pointer */
   saveStart = wordBuffer;
   } /* else */
   } /* while */
   return numberWords;
} /* findInputWords */


ulong findAnagrams(short numValidChars, ulong wordCount,
   WordLoc *validWords, short prevWordCount)
{
   ulong   wordIndex;
   ulong   usedIndex;
   short   chIndex;
   ulong   matchCount = 0;
   Boolean wordFits;
   char ch;
   char*tempPtr;
   WordLoc *theWord;



/* Try each word we have against the list of characters. */
   for (wordIndex=0; wordIndex<wordCount; wordIndex++)
   {
/* If there aren't enough characters left,  it can't be a match */
   if (validWords->fWordLength <= numValidChars)
   {
/* Go through the chars in this word testing to make sure that there 
is at least one of each char  available */
   wordFits = TRUE;
   for (chIndex=0; chIndex<validWords->fWordLength; chIndex++)
   {
   ch = validWords->fWordStart[chIndex];
   if (gValidChars[ch])
   gValidChars[ch]--;
   else
   {
/* Found an unavailable character, so this can't be part of the anagram. 
 Reset the character usage array and go to the next word. */
   wordFits = FALSE;
   while (--chIndex >= 0)
   gValidChars[validWords->fWordStart[chIndex]]++;
   break;  /* get out of the for loop */
   } /* else */
   } /* for */

   if (wordFits)
   {
/* This word fit, so see if it uses all the characters.   If so, then 
we have found an anagram.  Output the  anagram and increment the anagram 
count. */
   if (validWords->fWordLength == numValidChars)
   {
   matchCount++;
/* Copy the previous words for this anagram separated by spaces. */
   for (usedIndex=0; usedIndex<prevWordCount; usedIndex++)
   {
   theWord = gWordsInUse[usedIndex];
   memcpy(gOutputPtr, theWord->fWordStart,
   (size_t) theWord->fWordLength);
   gOutputPtr += theWord->fWordLength;
   *gOutputPtr++ = ' ';
   } /* for */
/* Now copy this new word and a return character */
   memcpy(gOutputPtr, validWords->fWordStart,
   (size_t) validWords->fWordLength);
   gOutputPtr += validWords->fWordLength;
   *gOutputPtr++ = RETURN;

/* To ensure that we don't overrun the output buffer check against the 
end of the buffer.  If the end pointer has been passed, write the data 
to the file  and reset the output pointer to the beginning of the buffer. 
*/
   if (gOutputPtr > gOutputBufferEnd)
   {
 *gOutputPtr = 0;/* Terminate the string */
   fprintf(gOutputFile, gOutputBuffer);
   gOutputPtr = gOutputBuffer;
   } /* if */
   }  /* if */
   else
   {
/* This word did fit, but didn't use all of the characters so add it 
to the list of previous words  in the anagram and then call this procedure 
recursively to find if there are more words that can be added to make 
an anagram with this base. */
   gWordsInUse[prevWordCount] = validWords;
   matchCount += findAnagrams(
   numValidChars - validWords->fWordLength,
   wordCount - wordIndex, validWords,
   prevWordCount + 1);
   } /* else */

/* Now undo the characters we took out of the validChar array */
   for (chIndex=0;chIndex<validWords->fWordLength;chIndex++)
   gValidChars[validWords->fWordStart[chIndex]]++;
   } /* if */
   } /* if */

  validWords++;
 } /* for */

   return matchCount;
} /* findAnagrams */







  
 

Community Search:
MacTech Search:

Software Updates via MacUpdate

Apple Pro Video Formats 2.0.1 - Updates...
Apple Pro Video Formats brings updates to Apple's professional-level codes for Final Cut Pro X, Motion 5, and Compressor 4. Version 2.0.1: Support for the following professional video codecs Apple... Read more
Maya 2015 - Professional 3D modeling and...
Maya is an award-winning software and powerful, integrated 3D modeling, animation, visual effects, and rendering solution. Because Maya is based on an open architecture, all your work can be scripted... Read more
EtreCheck 2.2 - For troubleshooting your...
EtreCheck is a simple little app to display the important details of your system configuration and allow you to copy that information to the Clipboard. It is meant to be used with Apple Support... Read more
OmniOutliner Pro 4.2 - Pro version of th...
OmniOutliner Pro is a flexible program for creating, collecting, and organizing information. Give your creativity a kick start by using an application that's actually designed to help you think. It's... Read more
VLC Media Player 2.2.1 - Popular multime...
VLC Media Player is a highly portable multimedia player for various audio and video formats (MPEG-1, MPEG-2, MPEG-4, DivX, MP3, OGG, ...) as well as DVDs, VCDs, and various streaming protocols. It... Read more
Nisus Writer Pro 2.1.1 - Multilingual wo...
Nisus Writer Pro is a powerful multilingual word processor, similar to its entry level products, but brings new features such as table of contents, indexing, bookmarks, widow and orphan control,... Read more
Tinderbox 6.2.0 - Store and organize you...
Tinderbox is a personal content management assistant. It stores your notes, ideas, and plans. It can help you organize and understand them. And Tinderbox helps you share ideas through Web journals... Read more
OmniOutliner 4.2 - Organize your ideas,...
OmniOutliner is a flexible program for creating, collecting, and organizing information. Give your creativity a kick start by using an application that's actually designed to help you think. It's... Read more
calibre 2.25.0 - Complete e-library mana...
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
Things 2.5.4 - Elegant personal task man...
Things is a task management solution that helps to organize your tasks in an elegant and intuitive way. Things combines powerful features with simplicity through the use of tags and its intelligent... Read more

Lifeline... (Games)
Lifeline... 1.1 Device: iOS Universal Category: Games Price: $2.99, Version: 1.1 (iTunes) Description: Lifeline is a playable, branching story of survival against all odds. Using your iPhone, iPad, or Apple Watch, you will help... | Read more »
Pandemic: The Board Game Has Gone Univer...
Don't let the virus win! Now you can download Pandemic: The Board Game, by F2Z Digital Media, for all of your iOS devices. The app is based on the fantastic board game by Z-man games. As employees of the CDC, you and your friends will have to work... | Read more »
Get Ready to Read Bloomberg Business on...
Fans of Bloomberg Business will soon be able to get all their news on the Apple Watch. The app lets you get the top headlines on your main screen and bookmark stories to read later. Using the motion detection in the Apple Watch, the headlines are... | Read more »
Watch This Homerun is Batting for the Ap...
Eyes Wide Games' Watch This Homerun is purportedly the first sports game coming to the Apple Watch, where you'll be up to bat as the pitcher tries to out-manuever you with fastballs, curveballs, and changeups. Using one-touch controls you can try to... | Read more »
Field Trip Can Take You on a Guided Tour...
Field Trip, by Google’s Niantic Labs, is an exploration app that gives you details about the awesome places you can discover wherever you find yourself. The app can show you local history, delicious restraunts, the best places to shop, and places to... | Read more »
Watch Your Six - SPY_WATCH is Infiltrati...
SPY_WATCH, by Bossa Studios, is a new game designed for the Apple Watch. Runmor has it your spy agency has fallen out of favor. To save it, you'll need to train-up a spy and send them on missions to earn you a stunningly suspicious reputation and... | Read more »
Both Halo: Spartan Assault and Halo: Spa...
Halo: Spartan Assault and Halo: Spartan Strike, by Microsoft, have officially landed on the App Store. Spartan Assault pits you against the Covenant with missions geared to tell the story of the origin of Spartan Ops. In Spartan Strike you'll delve... | Read more »
The Apple Watch Could Revolutionize the...
It’s not here yet but there’s that developing sneaky feeling that the Apple Watch, despite its price tag and low battery life, might yet change quite a lot about how we conduct our lives. While I don’t think it’s going to be an overnight... | Read more »
Mad Skills Motocross 2 Version 2.0 is He...
Mad Skills Motocross 2 fans got some good news this week as Turborilla has given the game its biggest update yet. Now you'll have access to Versus mode where you can compete against your friends in timed challenges. Turborilla has implemented a... | Read more »
Kids Can Practice Healthy Living With Gr...
Bobaka is releasing a new interactive book called Green Riding Hood  in May. The app teaches kids about yoga and organic style of life through mini-games and a fun take on the classic Little Red Riding Hood fairy tale. | Read more »

Price Scanner via MacPrices.net

Sale! 15-inch Retina MacBook Pros for up to $...
 MacMall has 15″ Retina MacBook Pros on sale for up to $255 off MSRP. Shipping is free: - 15″ 2.2GHz Retina MacBook Pro: $1794.99 save $205 - 15″ 2.5GHz Retina MacBook Pro: $2244.99 save $255 Adorama... Read more
New 2015 MacBook Airs on sale for up to $75 o...
Save up to $75 on the purchase of a new 2015 13″ or 11″ 1.6GHz MacBook Air at the following resellers. Shipping is free with each model: 11" 128GB MSRP $899 11" 256GB... Read more
Clearance 13-inch Retina MacBook Pros availab...
B&H Photo has leftover 2014 13″ Retina MacBook Pros on sale for up to $250 off original MSRP. Shipping is free, and B&H charges NY sales tax only: - 13″ 2.6GHz/128GB Retina MacBook Pro: $1129... Read more
Clearance 2014 MacBook Airs available startin...
B&H Photo has clearance 2014 MacBook Airs available for up to $200 off original MSRP. Shipping is free, and B&H charges NY sales tax only: - 11″ 128GB MacBook Air: $729 $170 off original MSRP... Read more
16GB iPad mini 3 on sale for $349, save $50
B&H Photo has the 16GB iPad mini 3 WiFi on sale for $349 including free shipping plus NY sales tax only. Their price is $50 off MSRP, and it’s the lowest price available for this model. Read more
Mac minis on sale for up to $75 off, starting...
MacMall has Mac minis on sale for up to $75 off MSRP including free shipping. Their prices are the lowest available for these models from any reseller: - 1.4GHz Mac mini: $459.99 $40 off - 2.6GHz Mac... Read more
Taichi Temple First Tai Chi Motion Sensor App...
Zhen Wu LLC has announced the official launch of Taichi Temple 1.0, the first motion sensor app for Tai Chi, offering a revolutionary new way to de-compress, relax and exercise all at the same time.... Read more
CleanExit – Erase your Hard Drive Quickly, Se...
CleanExit works on both Macs and PCs, securely and permanently deleting all files from any type of hard drive, flash-based drive or camera media card making the files permanently unrecoverable.... Read more
250 iPhone 6 Tips eBook Released for $1.99
Bournemouth, UK based iOS Guides has released 250 iPhone 6 Tips, a new eBook available in the iBookstore that reveals a wealth of tips and tutorials for iPhone 6 and iPhone 6 Plus. Priced at $1.99,... Read more
TigerText Introduces First Secure Enterprise...
TigerText, a provider of secure, real-time messaging for the enterprise, has announced the launch of TigerText for the Apple Watch. TigerText for the Apple Watch enables users to securely send and... Read more

Jobs Board

*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* 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
DevOps Software Engineer - *Apple* Pay, iOS...
**Job Summary** Imagine what you could do here. At Apple , great ideas have a way of becoming great products, services, and customer experiences very quickly. Bring Read more
*Apple* Pay - Site Reliability Engineer - Ap...
**Job Summary** Imagine what you could do here. At Apple , great ideas have a way of becoming great products, services, and customer experiences very quickly. Bring Read more
Sr. Technical Services Consultant, *Apple*...
**Job Summary** Apple Professional Services (APS) has an opening for a senior technical position that contributes to Apple 's efforts for strategic and transactional Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.