On Mon, 19 Nov 2007, Florian Klaempfl wrote:
> Martin Waldenburg schrieb:
> > 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,
>
> For sorting large stringlists a radixsort might be even better?
Well, the solution is very simple :
TSortAlgorithm = (saBubble,saShell,saMerge,saRadix,saQuick);
TStringList = Class(TStrings);
Property SortAlgorithm : TSortAlgorithm Read FSA Write FSA;
end;
I await your contributions, I'll take care of the rest.
And I _am_ serious.
Michael.
_________________________________________________________________
To unsubscribe: mail [EMAIL PROTECTED] with
"unsubscribe" as the Subject
archives at http://www.lazarus.freepascal.org/mailarchives
