Hello: Just a question. I've been lurking the source of LCL and I've seen that in many places (gtk, files and others...) to sort lists uses mergesort.
As far as I know, mergesort is used for sorting data with sequential access, or when random access is expensive. It needs to copy the original data, so it needs double memory. I can understand thet mergesort be used for linked lists, where you can't jump from position 30 to 1 without moving to 29..28..27 etc , but in Lazarus is used for standard arrays where quicksort shines. In fact, I've seen that Lazarus uses in quicksort many times. Santiago A. [email protected] -- _______________________________________________ Lazarus mailing list [email protected] http://lists.lazarus.freepascal.org/mailman/listinfo/lazarus
