(Recommended for BASIC programmers/Written in machine language)
SUPERSORT is a general-purpose, ultra high-speed sorting routine. For example, it can sort a thousand 30- byte names in less than 10 seconds (no, that’s not a misprint)! And it can sort a thousand 1-byte items in less than two seconds. You can easily call SUPERSORT from your BASIC program. SUPERSORT loads itself into RAM as an AUTORUN.SYS file whenever you boot up a diskette containing SUPERSORT. Then you run your BASIC program as usual, storing in one long string the items you want to sort. To sort these items, you simply POKE in your record and key lengths and then execute a USR function. SUPERSORT sorts the entire string in ascending order by your specified key.
SUPERSORT can handle any record of less than 180 bytes, and it can process as many as 10,000 records, depending on your memory size. It requires the sort key, which can be between 1 and 180 characters, to begin each record. SUPERSORT uses page 6 in memory as a scratch pad and about 900 bytes of RAM for itself. It installs itself below BASIC at boot time. This program is a combination of C. Hoare’s QUICK- SORT and a standard insertion sort. The algorithm is described in Donald Knuth’s Art of Computer Programming, vol. 3, p. 114. SUPERSORT includes the assembler editor source code to allow you to modify the program to fit your needs.
“This sort is incredibly fast. If you’ve ever waited for hours for a BASIC sort, you’ll appreciate this utility. Examples in the documentation make it easy to use.”
“This utility is designed for use only with BASIC. You can modify it for other uses, but it will take some work. SUPERSORT does no error checking, so you must write your calling program carefully; otherwise, it will happily sort all of memory for you, including your program. Because it uses the AUTORUN.SYS feature, it can be awkward to use the RS-232 ports of an ATARI 850 interface at the same time you use SUPERSORT.”
Diskette (Order No. APX-20030)
Advert on page 19, $17.95
Advert on page 29, $11.25