Paul Ishenin schrieb:
> Martin Waldenburg wrote:
>> 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
> If we are talking about TStringList.Sort then we will work with ansi
> strings. To compare ansi strings the best will be radial sort method. It
> doesnot use string compare at all - only chars compared level by level.
>
> I've not searched for english description of method but using google
> translate you can read this page: http://algolist.ru/sort/radix_sort.php
>
> There you can find C implementation of method. I also have somewhere
> pascal implementation.
> Some years ago I did comparision of quicksort, qucksort with inserts
> (which a bit faster than usual quicksort) and radial sort. Radial sort
> was the fastest.
>
> Best regards,
> Paul Ishenin.
I was talking about sorting Algorithms using the fastest possible
comparision for a given case.
Meaning all Algorithms using the same comparision,
else their speed can hardly be compared at all.
Martin
_________________________________________________________________
To unsubscribe: mail [EMAIL PROTECTED] with
"unsubscribe" as the Subject
archives at http://www.lazarus.freepascal.org/mailarchives
