Jan 93 Challenge
 Volume Number: 9 Issue Number: 1 Column Tag: Challenge

# Programmers' Challenge

By Mike Scanlin, MacTech Magazine Regular Contributing Author

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

## Challenge of the Month: Travelling Salesman

Recent discussions with friends about fuel efficiency reminded me of a problem I once had in a linear algebra class: A travelling salesman needs to visit a set of cities. He can go from any city to any other city and must visit each city exactly once. The question is, what is the optimal order of visitation that minimizes total distance travelled?

The prototype of the function you write is:

void OptimalPath(numCities,
startCityIndex, citiesPtr,
optimalPathPtr)
unsigned short numCities;
unsigned short  startCityIndex;
Point *citiesPtr;
Point *optimalPathPtr;
Example:

## Input:

numCities = 6
startCityIndex = 2
*citiesPtr = {1,4}, {2,2}, {2,1}, {5,7}, {4,6}, {2,6}

## Output:

*optimalPathPtr = {2,1}, {2,2}, {1,4}, {2,6}, {4,6}, {5,7}

numCities is a 1-based count of the number of cities to be visited (between 3 and 20, inclusive); startCityIndex is a zero-based index of the city in which the salesman starts ((2,1) in this example); citiesPtr is a pointer to an array of city locations (x and y locations are positive integers from 0 to 32767; each entry in the array is unique - no duplicate cities); optimalPathPtr points to an array (allocated by the caller) that OptimalPath fills in with the coordinates of the cities that the salesman should visit, in the order he should visit them (the first entry will always be citiesPtr[startCityIndex]).

## October Challenge winner!

The winner of the October “Name no one man” palindrome challenge is Stepan Riha (location unknown). His superb solution is overflowing with neat optimization tricks, starting from a good understanding of the problem at hand (right algorithm) and continuing on to efficient implementation details like precomputed multiplication tables (right code). This is a perfect example of what we’re looking for here in the Programmer’s Challenge column. Nice job, Stepan!

Credit is also given to three people who submitted solutions that were relatively close to Stepan’s winning time and code size: Leonid Braginsky (22% slower; Brighton, MA), Allen Stenger (37% slower; Gardena, CA) and Eric Slosser (40% slower; Berkeley, CA).

To those people who submitted solutions that use a precomputed lookup table containing every palindrome from 0 to 999,999,999 I have three words: Get a life. I can hear the moaning from here, “That’s not fair! He said the primary criteria was speed!” Well, that’s true, it is. However, there comes a point in programming when you have to sacrifice speed for reasonable code size and/or memory usage. It is my personal opinion that taking 30K+ to do what Stepan does in 426 bytes is not the right approach.

I have received several requests for statistics regarding the Programmer’s Challenge. Readers want to know how many entries I get, what test data I use, what the winning time and code size is, etc. I can and will satisfy some of those requests. Unfortunately, I can’t publish my test bench program or test data because of space constraints. But I can tell you that I generally test with several hand calculated values to verify that functions are returning correct results. Then I call each function several thousand times with random (same random seed for everyone; it’s fair) as well as average case inputs. I test edge cases but I don’t dwell on these. I’m not trying to trick people (a couple of people asked me about negative palindromes since I used long instead of unsigned long in my baseNumber parameter-it was an oversight on my part, not a trick); I’m just looking for good, fast code that handles a wide range of inputs.

Having said that, here are some numbers that I can share with you: The “pegs” challenge received 9 entries, “spell CAT” received 21 entries and “palindromes” received 22 entries. Of the 22 entries for palindromes, one gave bogus results, one gave a divide-by-zero error and three others took way too long (or were caught in some kind of infinite loop) so I stopped timing them. Of the remaining entries, the slowest one was 4.3 times slower than the winner and the largest one that didn’t use a huge lookup table was 2.8 times larger than the winner.

## Name No one man

/* 1 */
/* FindNthPalindrome by Stepan Riha
*
* This algorithm works with the following
* fact in mind: An N-digit string can form
* 9 * 10^((N-1)/2) palindromes:
*
* Odd N: Even N:
* 1st  100..000..001100..0000..001
* 2nd  100..010..001100..0110..001
* 3rd  100..020..001100..0220..001
* 100.......001 100........001
* 10th 100..090..001100..0990..001
* 11th 100..101..001100..1001..001
* 12th 100..111..001100..1111..001
* ............. ..............
* last-1 999..989..999   999..9889..999
* last 999..999..999999..9999..999
*
* Speedups are achieved bye replacing x*10
* with (x<<1 + x<<3) and by doing conversions
* requireing x/10 and x%10 on my own
* approximating 1/10 with 3/32. Also, I use
* a lookup table for powers of 10, etc.
*/

/* Precomputed values:
palins10 is an array of 9*10^((n-1)/2)
multpow10is a multiplication table of
10^n (last row is all 10^9
because of integer overflow)
*/

static long palins10[] = {
9L, 9L, 90L, 90L, 900L, 900L, 9000L,
9000L, 90000L, 90000L, 900000L
};

static long multpow10[100] = {
0L, 1L, 2L, 3L, 4L,
5L, 6L, 7L, 8L, 9L,
0L, 10L, 20L, 30L, 40L,
50L, 60L, 70L, 80L, 90L,
0L, 100L, 200L, 300L, 400L,
500L, 600L, 700L, 800L, 900L,
0L, 1000L, 2000L, 3000L, 4000L,
5000L, 6000L, 7000L, 8000L, 9000L,
0L, 10000L, 20000L, 30000L, 40000L,
50000L, 60000L, 70000L, 80000L, 90000L,
0L, 100000L, 200000L, 300000L, 400000L,
500000L, 600000L, 700000L, 800000L,
900000L,
0L, 1000000L, 2000000L, 3000000L, 4000000L,
5000000L, 6000000L, 7000000L, 8000000L,
9000000L,
0L, 10000000L, 20000000L, 30000000L,
40000000L, 50000000L, 60000000L, 70000000L,
80000000L, 90000000L,
0L, 100000000L, 200000000L, 300000000L,
400000000L, 500000000L, 600000000L,
700000000L, 800000000L, 900000000L,
0L, 1000000000L, 1000000000L, 1000000000L,
1000000000L, 1000000000L, 1000000000L,
1000000000L, 1000000000L, 1000000000L
};

/* (x * 10) */
#define Times10(x) ((x<<1) + (x<<3))
/* x *= 10 */
#define MultBy10(x) x += x + (x<<3)
/* (x * 3 / 32) */
#define ApproxDiv10(x) ((x>>4)+(x>>5))
/* (x/2) */
#define Half(x) ((x)>>1)

long FindNthPalindrome(long baseNumber, short n);

long FindNthPalindrome(register long base, short n)
{
register long num, dig, mult10, remain,
*lop, *hip, *multpow;
long   buffer[16];

if (base >= 1000000000L)
return -1L;

if (!(num = n))
/* 0th palindrome doesn't exist */
return base;

/* palindrome =
*     n-th palindrome > baseNumber */

/* Find dig = (number of digits in
* baseNumber) - 1
* Find how many dig-digit palindromes
* are smaller than the baseNumber
*/

if (base < 10) { /* baseNumber <= 9 */
dig = 0;
/* all 1-digit strings are
* palindromes (duh!)
*/
num += base - 1;
}
else { /* baseNumber is >= 10 */
/* Convert baseNumber to string.
* This is faster than using /1
* and %10
*/
lop = buffer; dig = -1;
while (base) {
remain = base; base = 0;
goto division1;
while (mult10) {
base += mult10;
remain -= Times10(mult10);
division1:
mult10 = ApproxDiv10(remain);
}
if (remain >= 10) {
base++; remain -= 10;
}
*lop++ = remain; dig++;
}
/* Find how many dig-digit palindromes
* are smaller than this string
* Start searching from the middle
*/
hip = (lop = buffer) + Half(dig+1);
lop += (base = Half(dig));
multpow = multpow10;
for(; base >= 0 && *lop==*hip;
hip++, lop--, multpow += 10, base--)
num += multpow[*hip];
if (base >= 0) {
if (*hip > *lop)
num--;
for(; base >= 0;
hip++, multpow += 10, base--)
num += multpow[*hip];
}
num -= multpow[-9];
} /* if (baseNumber < 10) */

/* palindrome =
*num-th palindrome > 10^dig */

/* Find how many digits the palindrome
* will have
*/
hip = (lop = palins10) + dig;
while (num >= 0)
num -= *hip++;
num += *(--hip);
dig = hip - lop;
if (dig >= 9)
/* i.e. baseNumber > 999999999
* (dig is always <= 10) */
return -1L;

/* palindrome =
*num-th dig-digit palindrome */

/* Find the num-th dig-digit paindrome.
* Calculate final palindrome string. This
* is faster than using /10 and %10
* Use lop and hip to point in the correct
* row in the multiplication table
* Start filling digits from the middle of
* the string
*/
base = Half(dig+1);
hip = (lop = multpow10) + Times10(base);
base = Half(dig);
lop += Times10(base);
base = 0L;
while (num) {
remain = num; num = 0;
goto division2;
while (mult10) {
num += mult10;
remain -= Times10(mult10);
division2:
mult10 = ApproxDiv10(remain);
}
if (remain >= 10) {
num++; remain -= 10;
}
base += lop[remain];
if (lop < hip)
/* don't count middle digit twice */
base += hip[remain];
lop -= 10; hip += 10;
}
lop = multpow10 + 1;
base += *lop;
if (dig) {
MultBy10(dig);
base += lop[dig];
}

return base;
}

## 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 “I won the MacTech Magazine Programming Challenge” T-shirt (not to be found in stores).{1}

In order to make fair comparisons between solutions, all solutions must be in ANSI compatible C. 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.

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 15th 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 e-mail. 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.

{1} The prize is subject to change in the event of production problems.

Community Search:
MacTech Search:

Parallels Desktop 13.3.0 - Run Windows a...
Parallels allows you to run Windows and Mac applications side by side. Choose your view to make Windows invisible while still using its applications, or keep the familiar Windows background and... Read more
Bookends 13.0.6 - Reference management a...
Bookends is a full-featured bibliography/reference and information-management system for students and professionals. Bookends uses the cloud to sync reference libraries on all the Macs you use.... Read more
macOS 10.13.3 Supplemental Update 1.0 -...
macOS High Sierra Supplemental Update includes security improvements to Safari and WebKit to mitigate the effects of Spectre. Version 1.0: Update fixes an issue where using certain character... Read more
Chromium 64.0.3282.167 - Fast and stable...
Chromium is an open-source browser project that aims to build a safer, faster, and more stable way for all Internet users to experience the web. Version 64.0.3282.167: [806388] High CVE-2018-6056:... Read more
Chromium 64.0.3282.167 - Fast and stable...
Chromium is an open-source browser project that aims to build a safer, faster, and more stable way for all Internet users to experience the web. Version 64.0.3282.167: [806388] High CVE-2018-6056:... Read more
Parallels Desktop 13.3.0 - Run Windows a...
Parallels allows you to run Windows and Mac applications side by side. Choose your view to make Windows invisible while still using its applications, or keep the familiar Windows background and... Read more
Bookends 13.0.6 - Reference management a...
Bookends is a full-featured bibliography/reference and information-management system for students and professionals. Bookends uses the cloud to sync reference libraries on all the Macs you use.... Read more
macOS 10.13.3 Supplemental Update 1.0 -...
macOS High Sierra Supplemental Update includes security improvements to Safari and WebKit to mitigate the effects of Spectre. Version 1.0: Update fixes an issue where using certain character... Read more
ffWorks 1.0.6 - Convert multimedia files...
ffWorks (was iFFmpeg), focused on simplicity, brings a fresh approach to the use of FFmpeg, allowing you to create ultra-high-quality movies without the need to write a single line of code on the... Read more
Adobe Acrobat 18.011.20035 - Powerful PD...
Acrobat DC is available only as a part of Adobe Creative Cloud, and can only be installed and/or updated through Adobe's Creative Cloud app. Adobe Acrobat DC with Adobe Document Cloud services is... Read more

## Latest Forum Discussions

Check out these 5 games that are a lot l...
So you're in love with Minecraft, but you're looking for something else to play as well? You've come to the right place then, because this list is all about games that are a bit like Minecraft. Some of them, more than others. [Read more] | Read more »
Our top 5 characters from casual RPG Cre...
Creature Quest definitely lives up to its name with a host of collectible creatures based on fantasy tales and world mythologies. To celebrate Creature Quest’s first birthday, we’re going to lay out what we think are the five best characters in the... | Read more »
Around the Empire: What have you missed...
Did you know that Steel Media has a whole swathe of other sites dedicated to all aspects of mobile gaming? Sure you'll get the very best iPhone news, reviews, and opinions right here at 148Apps, but we don't want you missing out on a single piece... | Read more »
All the best games on sale for iPhone an...
Oh hi there, and welcome to our round-up of the best games that are currently on sale for iPhone and iPad. You thought I didn't see you there, did you, skulking behind the bushes? Trust me though, the bushes aren't where the best deals are. The... | Read more »
The Battle of Polytopia Guide - How to H...
A new update just released for The Battle of Polytopia (formerly Super Tribes), which introduces online multiplayer. For all the fans of Midjiwan’s lite take on Civilization, this is certainly welcome news, but playing online isn’t as easy and... | Read more »
Here are the very best mobile games to p...
It's Valentine's Day! Did you get loads of cards and chocolates and other tacky, simple expressions of human affection? Did you send out tat because you find it almost impossible to express emotion unless there's a section dedicated to it at your... | Read more »
Florence (Games)
Florence 1.0 Device: iOS Universal Category: Games Price: \$2.99, Version: 1.0 (iTunes) Description: Florence is an interactive storybook from the award-winning lead designer of Monument Valley about the heart-racing highs and... | Read more »
Purrfect Date (Games)
Purrfect Date 1.0 Device: iOS Universal Category: Games Price: \$4.99, Version: 1.0 (iTunes) Description: Cats are a lil’ like marmite. Either you absolutely head-over-heels love’ em, or… nahhh, who are we kidding?! Everyone... | Read more »
More monsters to collect and evolve in C...
A laid-back mix of RPG and TCG, Creature Quest is all about building your deck, evolving your creatures and winning in battle. It’s the creation of VC Mobile, set up by Might and Magic producer Jon Van Caneghem. There are elements of that classic... | Read more »
Check out this awesome hands-on with the...
Well, PlayerUnknown's Battlegrounds has come out on mobile. This isn't a clone, this isn't a riff on the battleroyale mechanics of the game, it's the official mobile port by Tencent. But there's a little bit of a hitch. [Read more] | Read more »

## Price Scanner via MacPrices.net

Apple refurbished Mac minis in stock again st...
Apple has restocked Certified Refurbished Mac minis starting at \$419. Apple’s one-year warranty is included with each mini, and shipping is free: – 1.4GHz Mac mini: \$419 \$80 off MSRP – 2.6GHz Mac... Read more
Tuesday MacBook Deals: \$250 off 15″ 2.9GHz Ma...
Adorama has the Silver 15″ 2.9GHz Apple MacBook Pro on sale today for \$250 off MSRP. Shipping is free, and Adorama charges sales tax for residents in NY & NJ only: – 15″ 2.9GHz Silver MacBook Pro... Read more
Save up to \$350 with these Apple Certified Re...
Apple has a full line of Certified Refurbished iMacs available for up to \$350 off original MSRP. Apple’s one-year warranty is standard, and shipping is free. The following models are available: – 27... Read more
B&H offers \$200 discount on Silver 15″ Ma...
B&H Photo has Silver 15″ Apple MacBook Pros on sale for \$200 off MSRP. Shipping is free, and B&H charges sales tax for NY & NJ residents only: – 15″ 2.8GHz Touch Bar MacBook Pro Silver (... Read more
12″ Apple iPad Pro Sale of the Year! Models u...
B&H Photo has 12″ #iPad Pros on sale for up to \$150 off MSRP. Shipping is free, and B&H charges sales tax in NY & NJ only: – 12″ 64GB WiFi iPad Pro: \$719 \$80 off MSRP – 12″ 256GB WiFi... Read more
Deals on 32GB 9″ iPads: Up to \$50 off MSRP, s...
B&H Photo has 2017 9.7″ 32GB iPads on sale for \$299 including free shipping plus NY & NJ sales tax only. Their price is \$30 off MSRP, and it’s currently the lowest price available for these... Read more
15″ 2.2GHz Retina MacBook Pro available for o...
Apple has Certified Refurbished 15″ 2.2GHz Retina MacBook Pros available for \$1699. That’s \$300 off MSRP for this model, and it’s the lowest price available for a 15″ MacBook Pro currently offered by... Read more
13″ 3.1GHz/256GB Silver Touch Bar MacBook Pro...
Amazon has the Silver 13″ 3.1GHz/256GB Touch Bar MacBook Pro (MPXX2LL/A) on sale for \$1649.99 including free shipping. Their price is \$150 off MSRP, and it’s the lowest price available for a new 13″... Read more
Saturday Sale: Amazon offers 13″ 1.8GHz/256GB...
Amazon has the 13″ 1.8GHz/256B Apple MacBook Air on sale today for \$250 off MSRP including free shipping: – 13″ 1.8GHz/256GB MacBook Air (MQD42LL/A): \$949.99, \$250 off MSRP Their price is the lowest... Read more
Roundup of Apple Certified Refurbished 12″ Ma...
Apple has Certified Refurbished 2017 12″ Retina MacBooks available for \$200-\$240 off the cost of new models. Apple will include a standard one-year warranty with each MacBook, and shipping is free.... Read more

## Jobs Board

*Apple* Retail - Multiple Positions - Apple,...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
Strategist, *Apple* Media Products, Content...
# Strategist, Apple Media Products, Content and Marketing Job Number: 113399632 Santa Clara Valley, California, United States Posted: 20-Feb-2018 Weekly Hours: 40.00 Read more
*Apple* Store Leader - Retail District Manag...
Job Description:Job SummaryAs more and more people discover Apple , they visit our retail stores seeking ways to incorporate our products into their lives. It's your Read more
*Apple* Retail - Multiple Positions - Apple,...
Job Description:SalesSpecialist - Retail Customer Service and SalesTransform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
*Apple* Retail - Multiple Positions - Apple,...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more