On Tue, Aug 25, 2009 at 10:14:12PM +0200, Mattias Gaertner wrote:
[...]
Btw, there is a new kid in town: ParallelSort.
This uses a parallel mergesort and automatically uses several
threads. See here:
http://wiki.lazarus.freepascal.org/Parallel_procedures#Example:_parallel_sort
Zitat von Santiago A. s...@ciberpiula.net:
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
