DBSORT 1.0 - 15 November 1993 - Copyright 1993 Michael Geary

DBSORT is a fast database sort program for the Series 3a.  (Sorry, it won't
work on the Series 3.)  OPL source code is included.

DBSORT sorts my 400-entry address book in 25 seconds.  It could be made even
a little faster by combining the qsort and strcmp functions, but this would
make the code less readable.

It sorts the database on the first two fields using a QuickSort algorithm,
and the sort is case independent.

This version will sort a database of up to 2000 entries, as long as the text
of the first two fields of all the records will fit in memory.  You can
increase this limit by changing the definitions of r%, s%, and maxrec% at
the beginning of DBSORT.OPL.

DBSORT preserves the database records in their original format.  It does not
add any extra fields to the records.

Michael Geary
76146.42@compuserve.com
geary@bix.com