TweetFollow Us on Twitter

Radix Sort
Volume Number:7
Issue Number:5
Column Tag:Developer's Forum

Radix Sort with Prograph

By Robert McIvor, Gainesville, FL

Radix Sort with Prograph®

[Robert McIvor is a retired research chemist. He has been programming the Macintosh since 1984, and has developed programs for teaching and parsing Loglan®. Loglan is a constructed speakable language, capable of expressing the full range of human experience, yet whose sound stream and grammar are completely unambiguous The written language and potentially the spoken also are machine parsible.1]

Introduction

Prograph™ has been briefly described in MacTutor, March 1990. Now that a compiler to produce stand-alone applications is available, I decided to compare the performance with a C implementation. As a first experience, I attempted to convert the radix sort algorithm I described elsewhere2 to Prograph.

The sort time of the C version of the radix algorithm is linear in n, the number of records, in contrast to most currently used sorts, which are proportional to n log n. Unlike other algorithms, the time is also directly proportional to the length of the sort key; i.e. it takes as long to process 1000 10-byte keys, as to process 10000 1-byte keys. The previously published version sorted 20,000 bytes/sec. on an SE-30. An improved version sorts 88,235 bytes/sec. The C code for unbelievers is provided on this month’s source disk, along with Prograph implementations.

The Prograph Language

Prograph is a data-flow, graphical language with object-oriented capability. Development is in an interpreted mode, with excellent debugging facilities completely integrated. It is suited to those who like planning and coding completely before execution, as well as those who would prefer to code a line at a time and immediately see the result. Unlike many object-oriented programs, local variables may be added or removed from an object with instances. All instances are appropriately adjusted. If while executing, a non-existent method or variable is encountered, one is offered the chance to add it on the fly. Run-time errors are well explained. A faulty value may be temporarily fixed, and execution allowed to proceed, or the code may be fixed, in which case the execution is automatically backed up to the point where the code was changed. Current data values can be examined by double clicking on their entry and exit points in the flow diagram, which is the code.

One of the nice features of Prograph is that one does not have to concern oneself with event loops, updating, activating, screen redrawing, Multifinder compatibility, resizing, zooming etc. unless one so wishes. All these things are handled automatically.

The correct number of input and output terminals is provided with the icon for both Prograph internal and Macintosh toolbox routines, and the input is type-checked.

The Algorithm

Let us consider a series of decimal numbers to be sorted. If one sets up 10 bins, passes through the list of numbers placing each in the appropriate bin according to the least significant digit, and then combines the bins in order without changing the order of numbers in the bin, by repeating the process with the next most significant digit until all digits have been used, one will have sorted the numbers. For computer implementation, the bins are linked lists, and only pointers to the data are manipulated. If bit bins are used, only two lists need be manipulated, while for byte bins, up to 256 may be required, depending on the nature of the data. After each pass through the sort key, the lists are joined, and the new list is used for the next pass. For a straightforward implementation, the sort time depends linearly on the number of records to be sorted, and the number of passes, which in turn is related only to the number of “bins” and sort key length.

The Prograph Implementation

Figure 1 shows a window, designed with the Application editor of Prograph. It contains two edit text items, three fixed text, and a button. Each item when drawn is given a name, and the button is assigned a routine dosort to be executed when it is pressed. Note that if no menu is provided to Prograph, a default menu appears which contains the Apple menu (with an ‘About Radix Sort ’ item and the desk accessories) and a File menu with a ‘Quit’ item.

Figure1 - Display window

Figure 2 shows the dosort code. Since it belongs to the Window class, three inputs are automatically provided, viz. the window pointer, the button item, and the event record. I have only used the Window record, as data for two local routines called get-parameters, and set-parameters. Local routines can be used at any time to reduce clutter in a code window. They can be set up before coding, or a set of routines in a window can be enclosed in a marquee or otherwise selected, and converted to a local. If the latter method is used, the icon automatically has the proper input and output terminals.

Figure 2 - Dosort code window

The sort routine was developed and tested independently with fixed inputs, and attached to the window later.

Figure 3 - Get-parameters code window

Figure 3 shows the get-parameters local. The edit text items are named Sortsize and Sortlist. The built-in universal find-item takes a window pointer and item name/number, and provides as output the item number/name, and the item. The text attribute of the items are read. These are strings. The built-in routine from-string converts the string to a list, integer, or other type depending on its form. Thus Sortsize becomes an integer, and Sortlist becomes a list.

Figure 4 shows the set-parameters routine. In this case the text item Time is found. The sort times and sort list are converted to strings with to-string The time is concatenated with the string “Time in ticks: “ and placed in the text item, and the sorted list in the edit text item.

Figure 4 - Set-parameters code window

Figure 5 - Sort code window

For the sort itself (Figure 5), two persistents were set up. The first, Collation, was the list (A a B b C c D d E e F f G g H h I i J j K k L l M m N n O o P p Q q R r S s T t U u V v W w X x Y y Z z 0 1 2 3 4 5 6 7 8 9) and the second, Empty, was a list of 62 null lists.

The list to be sorted, the Empty persistent and the sort length are passed into the local outer-loop The partially sorted output, and the length (which is internally altered) are recycled into the input using the loop operation. Note how easy timing is with Prograph. Two times are obtained with the Toolbox routine TickCount and subtracted. Synchronization arrows are used to show that the first must be done before outer-loop and the second afterwards. This is easily adapted to timing any operation.

The outer-loop local is shown in Figure 6. A copy is made of the Empty persistent, as the feed-back from sort-one-level changes it if this is not done, and changed persistents persist through subsequent executions. The three inputs are passed to the window routine sort-one-level which is also a loop operation with all three outputs looped back to the input. The final partially sorted output is a list of lists, which is converted to a simple list of strings with the Window routine fix-string. An earlier version had the input accept the list of lists, but as the extraction was recursive, the sort-one-level had to be internal to the extraction routine, and the final output had to be processed. The current version proved to be faster.

Figure 6 - Outer-loop code window

Also the sort-length is checked, and the outer-loop is terminated if the value is zero. After one level is sorted, the count is reduced by one. Synchros are used to ensure the proper execution order.

Figure 7 - Sort-one-level code window

Figure 7 shows the sort-one-level routine. The first step is to detach one string from the sort list and check the remainder for the empty list. If true, the routine terminates at the end of the current pass. One byte is extracted from the detached string at the current sort-key position using the middle function, and passed to the (in) function to determine its position in the persistent list Collation. The output is a numerical position, which is passed to get-nth to locate the sublist (“bin”) for the detached item, which is then attached to the bin list at the right end with attach-r. The modified bin is re-inserted into the initially-empty list of lists with set-nth! and recycling continues until each item has been placed in its “bin”.

Figure 8 - Fix-string code window

Figure 8 shows the Window routine fix-string This passes a null list and the partially-sorted list of lists to a routine ‘simplify’ which loops until complete.

Simplify (Figure 9) checks for and terminates on a null list. Otherwise it removes the first item with detach-l and cycles the residual list. The detached item is sent to the Window routine process (Figure 10) which has 3 cases. The first checks for a null list (empty “bin”) and ignores it if true. The second checks if the detached item was a list. If so, it joins it to the list being built. Initially, this was done by recursion, but it was found stack overflow occurred with only a moderate number of items to be sorted. The third case attaches a simple string to the output list. When outer-loop reaches completion, the output list is the sorted list.

Figure 9 - Simplify code window

Figure 10 - Process code window

Another approach, involving only two bins is also included on the source disk. The outer loop is similar, except that the sort-one-level routine is not looped, and only the count and sort key are input.

Figure 11 - 2-bin Sort-one-level window

The 2-bin sort-one-level (Figure 11) uses the Prograph list processing operation. A single operation produces a list of all the bytes in the current ‘count’ position of the input list items. This list, and the original sort-key list are passed to the routine bitsort, which returns a list sorted by the count byte. The bitsort routine (Figure 12) takes a list input of bit masks (for simple ASCII, the 8th bit is ignored). The byte list and the sort key lists are sorted by each bit in turn by the routine bitloop and the sorted lists are looped back to the input. The bitloop routine (Figure 13) uses the local extract-a-bit to get a list of the appropriate bits of each byte in the byte list, and passes the bit list to two instances of a routine split-by-bit which puts the byte list and the sort key list into one of two lists depending on whether the bit is 0 or non-zero. Each of the list pairs is then joined to produce two single bit-sorted lists which are recycled into the input of bit-loop.

Figure 12 - Bitsort code window

Figure 13 - Bitloop code window

Figure 14 - Extract-a-bit code window

The extract-a-bit local (Figure 14) converts the byte with to-ascii, which gives a one-item list, which must be unpacked to give an integer, which can then be bit-anded with the mask to give either 0 or the mask-value.

The routine split-by-bit (straightforward, not shown) takes the bit-list and the byte or sort-key list, compares each bit-list member to 0 and puts the corresponding member of the other list into one of two output lists depending on the result.

Results

Before programming the first method, I determined by timing that extraction and insertion of the nth item of a list was reasonably independent of n, for lists up to 1000 in length.

The first method (sorting by bytes) is reasonably linear over short intervals, but much less so over long intervals. Some routines, like unpacking the list-of-lists are probably dependent on n. The times to sort the same list vary appreciably, probably because of garbage collection during the sort. Unlike the C routine, it is also somewhat dependent on the original order of the sort keys. It is, however, nearly linear in its dependence on the number of bytes per key.

The second method is much more nearly linear in n.

For comparison of all three methods, I sorted from 1 to 62 members of a 62-membered 5-byte list (with the Prograph programs), and a list of 1000 5-membered Loglan ‘primitives’. The 1000 word sort took .057secs with the C program, about 207 secs with the interpreted byte-sorted version, and 1029 seconds with the bit-sorted version.

A compiler which is available with Prograph produces a double-clickable stand-alone program, which can be listed in assembly language. The byte-sort compiled program sorted the 1000 words in from 64-100 seconds, a 2 to 3-fold speedup, but the bit-sorted compiled version ran in 25 seconds, a 40-fold increase in speed! TGS systems point out that list operations are faster than loop operations, which certainly seems to be the case.

The compilation took about 75 seconds, and the size of the compiled programs were 178 and 173K compared with the interpreted code at 61 and 56K, despite the documentation which claims that compiling saves space. Of course the interpreted code requires the interpreter as well.

Neither method, as such, would be very practical for the radix sort, since the fastest time is still 450 times slower than C. Fortunately, one can have the best of both worlds. One can write XPrims, which can be used in interpreted (or compiled) programs just as the built-in routines provided with Prograph, or XCode, which are external routines which can be linked with Prograph compiled programs. These can be written in Think C or MPW C. One can therefore have the advantage of a very easily produced graphical interface compatible with Macintosh guidelines combined with rapidly executing C routines. As my C compiler is not one of those supported, I leave the writing of a sort X-Prim as an exercise for the reader.

The program as presented does not do any checking of the input. While the interpreted version seems foolproof, the compiled program bombs easily with bad data. The inclusion of checking is also left as an exercise for the reader.

References

1 Further information on Loglan can be obtained from the non-profit Loglan Institute Inc., 1701 N.E. 75th St., Gainesville FL 32601, or from the author.

2 McIvor Robert A., “A General First-Order Sorting Algorithm”, Dr. Dobb’s Journal,M&T Publishing, Inc., Sep 1986, pg. 32

 
AAPL
$102.57
Apple Inc.
+0.32
MSFT
$45.09
Microsoft Corpora
+0.21
GOOG
$570.78
Google Inc.
+1.58

MacTech Search:
Community Search:

Software Updates via MacUpdate

VueScan 9.4.41 - Scanner software with a...
VueScan is a scanning program that works with most high-quality flatbed and film scanners to produce scans that have excellent color fidelity and color balance. VueScan is easy to use, and has... Read more
Cloud 3.0.0 - File sharing from your men...
Cloud is simple file sharing for the Mac. Drag a file from your Mac to the CloudApp icon in the menubar and we take care of the rest. A link to the file will automatically be copied to your clipboard... Read more
LibreOffice 4.3.1.2 - Free Open Source o...
LibreOffice is an office suite (word processor, spreadsheet, presentations, drawing tool) compatible with other major office suites. The Document Foundation is coordinating development and... Read more
SlingPlayer Plugin 3.3.20.505 - Browser...
SlingPlayer is the screen interface software that works hand-in-hand with the hardware inside the Slingbox to make your TV viewing experience just like that at home. It features an array of... Read more
Get Lyrical 3.8 - Auto-magically adds ly...
Get Lyrical auto-magically add lyrics to songs in iTunes. You can choose either a selection of tracks, or the current track. Or turn on "Active Tagging" to get lyrics for songs as you play them.... Read more
Viber 4.2.2 - Send messages and make cal...
Viber lets you send free messages and make free calls to other Viber users, on any device and network, in any country! Viber syncs your contacts, messages and call history with your mobile device,... Read more
Cocktail 7.6 - General maintenance and o...
Cocktail is a general purpose utility for OS X that lets you clean, repair and optimize your Mac. It is a powerful digital toolset that helps hundreds of thousands of Mac users around the world get... Read more
LaunchBar 6.1 - Powerful file/URL/email...
LaunchBar is an award-winning productivity utility that offers an amazingly intuitive and efficient way to search and access any kind of information stored on your computer or on the Web. It provides... 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
BBEdit 10.5.12 - Powerful text and HTML...
BBEdit is the leading professional HTML and text editor for the Mac. Specifically crafted in response to the needs of Web authors and software developers, this award-winning product provides a... Read more

Latest Forum Discussions

See All

The Walking Dead Pinball Review
The Walking Dead Pinball Review By Blake Grundman on August 29th, 2014 Our Rating: :: DECISIONS, DECISIONS...Universal App - Designed for iPhone and iPad Zen Studios is at it again, taking a property that would never seem to work... | Read more »
Stupeflix Has Released a Major Update fo...
Stupeflix Has Released a Major Update for Replay Posted by Jessica Fisher on August 29th, 2014 [ permalink ] iPhone App - Designed for the iPhone, compatible with the iPad | Read more »
ALONE… Review
ALONE… Review By Jennifer Allen on August 29th, 2014 Our Rating: :: MINIMALISTIC AND TOUGHUniversal App - Designed for iPhone and iPad Tough yet satisfying, ALONE… is a challenging endless flyer with some suitably sensitive... | Read more »
Hyperlapse Review
Hyperlapse Review By Jennifer Allen on August 28th, 2014 Our Rating: :: SPEEDY VIDEO SNAPSUniversal App - Designed for iPhone and iPad Want to make a great time-lapse video quickly? Hyperlapse is perfect for that.   | Read more »
Back To Bed Review
Back To Bed Review By Jennifer Allen on August 28th, 2014 Our Rating: :: STYLISH BUT LIMITEDUniversal App - Designed for iPhone and iPad It looks gorgeous, but Back to Bed is actually a fairly simple and uneventful puzzle game.   | Read more »
New Cars, New Locations, and a New Seaso...
New Cars, New Locations, and a New Season in Asphalt 8: Airborne Update Posted by Jessica Fisher on August 28th, 2014 [ permalink ] Universal App - Designed for iPhone and iPad | Read more »
Award Winning Children’s Book Bedtime fo...
Bedtime for Sarah Sullivan is a children’s storybook that emphasizes the importance of going to bed, dreams, and those magical moments right before being tucked in. Now Kelly Paniagua, author of the award-winning children’s book, is planning to... | Read more »
Happy Cube Death Arena Review
Happy Cube Death Arena Review By Jordan Minor on August 28th, 2014 Our Rating: :: CUBEDUniversal App - Designed for iPhone and iPad Happy Cube Death Arena is adorably violent, but very, very shallow.   | Read more »
8bit Doves, the New Game from Icebreaker...
8bit Doves, the New Game from Icebreaker Developers Nitrome, is Now Available – and in Four Colours Posted by Ellis Spice on August 28th, 2014 [ | Read more »
Ace Ferrara and the Dino Menace Review
Ace Ferrara and the Dino Menace Review By Nadia Oxford on August 28th, 2014 Our Rating: :: DINO-MYTEUniversal App - Designed for iPhone and iPad Ace Ferrara and the Dino Menace combines space combat and weird humor into a fun game... | Read more »

Price Scanner via MacPrices.net

New 21″ 1.4GHz iMac on sale again for $999, s...
Best Buy has the new 21″ 1.4GHz iMac on sale for $999.99 on their online store. Their price is $100 off MSRP. Choose free shipping or free local store pick up. Price is for online orders only, in-... Read more
Smartphone Outlook Remains Strong for 2014, U...
According to a new mobile phone forecast from the International Data Corporation (IDC) Worldwide Quarterly Mobile Phone Tracker, more than 1.25 billion smartphones will be shipped worldwide in 2014,... Read more
Save up to $60 with Apple refurbished iPod to...
The Apple Store has Apple Certified Refurbished 5th generation iPod touches available starting at $149. Apple’s one-year warranty is included with each model, and shipping is free. Many, but not all... Read more
12-Inch MacBook Air Coming in 4Q14 or 2015 –...
Digitimes’ Aaron Lee and Joseph Tsai report that according to Taiwan-based upstream supply chain insiders, Apple plans to launch a thinner MacBook model either at year end 2014 or in 2015, and that... Read more
Sapphire Screen “Most Wanted” iPhone 6 New Fe...
According to the ‘uSell.com iPhone Most Wanted Survey’ — a representative survey of 1,000 U.S. smartphone users conducted by used iPhone marketplace uSell.com — close to half of all smartphone users... Read more
The iPad’s Real Competitive Challenger (Not S...
It’s been my contention for some time that the iPad is suffering from something of an identity crisis, and I suspect that may be a factor in slackening sales this year. Apple can’t seem to decide... Read more
13-inch 2.6GHz/256GB Retina MacBook Pro on sa...
B&H Photo has the 13″ 2.6GHz/256GB Retina MacBook Pro on sale for $1379 including free shipping plus NY sales tax only. Their price is $120 off MSRP. Read more
Life Inventory iOS Apps – Learn to Know Thyse...
James Hollender’s Life Inventory apps s are now on sale with 20% off thru Labor Day, 09/01/2014. This is a great opportunity to get started on that Moral Inventory you’ve been putting off doing for... Read more
Pocket Watch, LLC. Reveals Cloud Server For P...
Beaumont, Texas based Pocket Watch, LLC. has announced the availability of its new ActivePrint Cloud Server Powered by Raspberry Pi. With this small standalone box almost any USB printer or available... Read more
902it Simplifies Area Code Changes For Nova S...
The east coast Canadian provinces of Nova Scotia and Prince Edward Island are phasing in 10 digit telephone dialing, to be fully in place by November, in order to accommodate a second area code to... Read more

Jobs Board

*Apple* Retail - Multiple Positions (US) - A...
Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, you're also the Read more
*Apple* Retail - Multiple Positions (US) - A...
Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, you're also the Read more
Senior Event Manager, *Apple* Retail Market...
…This senior level position is responsible for leading and imagining the Apple Retail Team's global event strategy. Delivering an overarching brand story; in-store, Read more
*Apple* Solutions Consultant (ASC) - Apple (...
**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
Project Manager / Business Analyst, WW *Appl...
…a senior project manager / business analyst to work within our Worldwide Apple Fulfillment Operations and the Business Process Re-engineering team. This role will work Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.