[fpc-pascal] Re: TimSort
Marco van de Voort
marcov at stack.nl
Tue May 24 18:53:59 CEST 2011
In our previous episode, Uffe Kousgaard said:
> > Why is TimSort specially interesting to you ?
> If it is the best all-purpose sorting algorithm and now the standard in
> several other programming languages, it should be obvious why it is also
> worth looking at for pascal / delphi developers.
A quick look at wikipedia will show that timsort has a disadvantage too. It
needs up to N records memory, not just Log(n) records like e.g. Quicksort.
More information about the fpc-pascal