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

 

Community Search:
MacTech Search:

Software Updates via MacUpdate

Minecraft 302 - Popular sandbox building...
Minecraft allows players to build constructions out of textured cubes in a 3D procedurally generated world. Other activities in the game include exploration, gathering resources, crafting, and combat... Read more
FotoMagico 5.2b8 - Powerful slideshow cr...
FotoMagico lets you create professional slideshows from your photos and music with just a few, simple mouse clicks. It sports a very clean and intuitive yet powerful user interface. High image... Read more
TeamViewer 11.0.65452 - Establish remote...
TeamViewer gives you remote control of any computer or Mac over the Internet within seconds, or can be used for online meetings. Find out why more than 200 million users trust TeamViewer! Free for... Read more
Dropbox 9.4.49 - Cloud backup and synchr...
Dropbox is an application that creates a special Finder folder that automatically syncs online and between your computers. It allows you to both backup files and keep them up-to-date between systems... Read more
Geekbench 4.0.0 - Measure processor and...
Geekbench provides a comprehensive set of benchmarks engineered to quickly and accurately measure processor and memory performance. Designed to make benchmarks easy to run and easy to understand,... Read more
Nisus Writer Pro 2.1.5 - 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
Default Folder X 5.0.6 - Enhances Open a...
Default Folder X attaches a toolbar to the right side of the Open and Save dialogs in any OS X-native application. The toolbar gives you fast access to various folders and commands. You just click on... Read more
Alfred 3.1 - Quick launcher for apps and...
Alfred is an award-winning productivity application for OS X. Alfred saves you time when you search for files online or on your Mac. Be more productive with hotkeys, keywords, and file actions at... Read more
MYStuff Pro 2.0.25 - Create inventories...
MYStuff Pro is the most flexible way to create detail-rich inventories for your home or small business. Add items to MYStuff by dragging and dropping existing information, uploading new images, or... Read more
OmniOutliner Pro 4.6 - 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

Lifeline: Crisis Line (Games)
Lifeline: Crisis Line 1.0.0 Device: iOS Universal Category: Games Price: $2.99, Version: 1.0.0 (iTunes) Description: | Read more »
BLUK (Games)
BLUK 1.1 Device: iOS Universal Category: Games Price: $1.99, Version: 1.1 (iTunes) Description: ** ‘Upcoming Game of the Year’ Finalist at NGF Awards 2015 ** ** ‘Big Indie Pitch’ Nominee at Pocket Gamer Connects 2016... | Read more »
Six! Tips, tricks, and hints for beginne...
There's nothing pretentious about Six!, the latest release from Gram Games. As puzzlers go, it's so unassuming that it took me some time to even realize why it was called what it was. Somewhere, my high school geometry teacher is now sobbing... | Read more »
Mobius Final Fantasy: Multiplayer update...
Up until now, Mobius Final Fantasy has been about as single-player an experience as an RPG can be. Not only do you play solo, but you are literally one among a seemingly unending wave of faceless warriors on the road toward the same goal. [Read... | Read more »
Find out the story behind League of Ange...
If you’re looking for a new thrilling MMORPG to play with your friends then you’ll be excited to hear that there is a sequel to one of the most well known titles in the genre – namely League of Angels 2. With a brand new 3D engine offering... | Read more »
Naruto Shippuden: Ultimate Ninja Blazing...
I'm not sure if it's possible to say you are an anime fan but also never have seen one episode of Naruto. If it is, then I resemble that remark, and if not, I offer a hearty apology. [Read more] | Read more »
5 mobile games that let you explore spac...
No Man's Sky hasn't exactly turned out to be everything it was promised. Though its core concept of exploring an unimaginably vast universe of different planets is an intriguing one, the execution has left many PS4 and PC gamers feeling like they... | Read more »
Mummy madness in new action game Tomb He...
Hot on the tail of Bump Hero, ZPlay is giving gamers another reason to get screen bashing with a brand new release. Tomb Heroes is a challenging action game in which you battle enemies in various tombs around the world. You can select from nine... | Read more »
Siralim 2 (RPG / Roguelike) (Games)
Siralim 2 (RPG / Roguelike) 1.0 Device: iOS Universal Category: Games Price: $4.99, Version: 1.0 (iTunes) Description: Siralim 2 is an old-school monster catching RPG. Summon and customize hundreds of creatures to fight for you as... | Read more »
Clean Text (Productivity)
Clean Text 1.0 Device: iOS Universal Category: Productivity Price: $3.99, Version: 1.0 (iTunes) Description: | Read more »

Price Scanner via MacPrices.net

That Upgrade Itch; How Often Do You Upgrade Y...
I have a quandary to resolve as we head into what is typically a major Apple product upgrade season. My mid-2013 MacBook Air will be three years old and my iPad Air 2 will be two come late November.... Read more
Apple refurbished 12-inch iPad Pros available...
Apple has Certified Refurbished 12″ iPad Pros available for up to $160 off the cost of new iPads. An Apple one-year warranty is included with each model, and shipping is free: - 32GB 12″ iPad Pro... Read more
Tim Cook Posts Open Letter To The Apple Commu...
Apple Inc. CEO Tim Cook has posted an open letter commenting on the European Commission’s bizarre demand that Apple pay more than $14 billion in allegedly underpaid back taxes on its Irish... Read more
Streetwise Drivers Club App Now Features Open...
Streetwise Drivers Club, an app that rewards drivers with deals on everything from dining and gift cards to tires and insurance, has announced the launch of a new enhancement connecting app users... Read more
15-inch Retina MacBook Pros on sale for up to...
B&H Photo has 15″ Retina Apple MacBook Pros on sale for up to $200 off MSRP. Shipping is free, and B&H charges NY tax only: - 15″ 2.2GHz Retina MacBook Pro: $1799 $200 off MSRP - 15″ 2.5GHz... Read more
RESCUECOM 2016 Semi-Annual Computer Reliabili...
The beginning of a new school year is upon us again, in which students and parents have some very important choices to make, often including the purchase of a computer or tablet. Whether you are... Read more
VRS Design Damda Glide Series iPhone 7 and 7...
What makes the Damda Glide Series for the iPhone 7 and iPhone 7 Plus special? Case maker VRS Design says its Damda Glide Series is the first mobile case to incorporate a semi-automatic mechanism for... Read more
Apple refurbished iMacs available for up to $...
Apple has Certified Refurbished 2015 21″ & 27″ iMacs available for up to $350 off MSRP. Apple’s one-year warranty is standard, and shipping is free. The following models are available: - 21″ 3.... Read more
Clearance 2015 13-inch MacBook Airs available...
B&H Photo has clearance 2015 13″ MacBook Airs available for $350 off original MSRP. Shipping is free, and B&H charges NY sales tax only: - 13″ 1.6GHz/4GB/128GB MacBook Air (MJVE2LL/A): $829... Read more
Check Apple prices on any device with the iTr...
MacPrices is proud to offer readers a free iOS app (iPhones, iPads, & iPod touch) and Android app (Google Play and Amazon App Store) called iTracx, which allows you to glance at today’s lowest... Read more

Jobs Board

*Apple* Retail - Multiple Positions Norfolk,...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
*Apple* Retail - Multiple Positions- Tampa,...
Job Description:SalesSpecialist - Retail Customer Service and SalesTransform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
SW Engineer *Apple* TV - Apple Inc. (United...
The Apple TV team is looking for excellent software engineers with experience in hardware, media management, media playback, content delivery and a passion for Read more
*Apple* Solutions Consultant - Apple (United...
Apple Solutions ConsultantJob Number: 51218534Pleasant Hill, California, United StatesPosted: Aug. 18, 2016Weekly Hours: 40.00Job SummaryAs an Apple Solutions Read more
*Apple* Solutions Consultant - Apple (United...
# Apple Solutions Consultant Job Number: 51218354 Fredericksburg, Virginia, United States Posted: Aug. 18, 2016 Weekly Hours: 40.00 **Job Summary** As an Apple Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.