Hello FPC-Pascal, Wednesday, May 25, 2011, 9:02:46 AM, you wrote:
MvdV> For heavier sorting I usually use heapsort and quicksort routines that date MvdV> back to my M2 days MvdV> Usually heapsort since it is quite fast for already sorted collections. Instead HeapSort you can use SmoothSort which is around 10-20% faster in almost all conditions (sorted or not) and have the same memory and best/worst case constraints. -- Best regards, José _______________________________________________ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/mailman/listinfo/fpc-pascal
