I seem to remember that Bubble Sort (going back to my Comp. Sci. degree
at Vic.) is one of the worst performing (n^2 performance, where n is the
numer of things you are sorting). However I seem to remember that Quick
sort had similar worst case sorting performance, however avoiding
special conditions performed at n*log(n). I seem to remember that Merge
Sort was the best overall (n*log(n) worst case), however was not very
friendly to write. Although if you have less than 100 items it's
probably not going to matter very much.
Those were the days, sigh.....
Alister Christie
Leigh Wanstead wrote:
I have not followed the discussion closely.
I just read bubble sort topic and thought why reinvent the whole wheel.
TList already has a method Sort which use QuickSort. QuickSort is better
than bubble sort.
_______________________________________________
Delphi mailing list
[EMAIL PROTECTED]
http://ns3.123.co.nz/mailman/listinfo/delphi
