sort		Version 1.36		by Rüdiger Werner

History
-------

Version 1.00 - 1.20
internal versions which contained several bugs
written on a PC because of lack of a working C-Compiler for AMIGA

Version 1.21
adapted to AMIGA
now it can be compiled with the DICE-C-Compiler V2.06.21
written by Matthew Dillon

Version 1.22
removed the bug that the program crashes if a line in input file is longer
than the limit. But 1024 Byte is quite long. So I don't think it will
be reached. If yes after all, the bytes which are too much will be cutted.

Version 1.23
added the -n|N switch
Translated the program into English, optimized the code a little bit.

Version 1.24
made some changes on the part where switches are interpreted
now some contradictions removed

Version 1.25
the loading routine completely new implemented, now needs less memory

Version 1.30
implemented an improved algorithm for sorting.
Now the speed is more than twice as fast as before.

Version 1.31
optimized the erasing of empty lines, so sorting becomes faster
added some colors

Version 1.32
optimized setting of switches
added -j|J switch; now it's possible to join as much files as memory allows
removed some bugs, which could be troublesome (actually every bug is this)

Version 1.33
added -f[y] and -l[y] switch
now it's possible to sort within a given range, of course the speed becomes
slower due to additional code in the sorting routine
if no range is given the speed is around 10 per cent faster as before

Version 1.34
removed a bug which could be fatal.
Due to some changings in the sorting routine the speed has been increased
again.

Version 1.35
don't remember, because of the long time which has gone (holidays...)
oh yes, added the -s option

Version 1.36
added the -P option
the -s option can now be used also in a given range, means it works now as
the other functions too.
as usual the sorting speed could be increased a little bit again