Michael Van Canneyt schrieb:
> Probably we could put a shellsort behind it, and no-one would notice :-)
for comparision intensive sorting a well implemented Mergesort
beats everything,
especialy with caseinsensitive Unicode it can exceed other
Algorithms 100 times for larger lists.
It uses slightly more memory thought.
It be improved even furter by doing some preprocessing
before doing the actual sort.
Martin
_________________________________________________________________
To unsubscribe: mail [EMAIL PROTECTED] with
"unsubscribe" as the Subject
archives at http://www.lazarus.freepascal.org/mailarchives
