On Wed, 25 May 2011 09:29:09 +0200
Mattias Gaertner wrote:
> On Wed, 25 May 2011 09:02:46 +0200 (CEST)
> mar...@stack.nl (Marco van de Voort) wrote:
>
> > In our previous episode, Mattias Gaertner said:
> > > > A quick look at wikipedia will show that timsort has a disadvantage
> > > too. It
>
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 whic
On Wed, 25 May 2011 09:02:46 +0200 (CEST)
mar...@stack.nl (Marco van de Voort) wrote:
> In our previous episode, Mattias Gaertner said:
> > > 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.
>
In our previous episode, Mattias Gaertner said:
> > 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.
> It *can* be implemented to need only log(n). But the current fpc
> implementation
> of
Marco van de Voort hat am 24. Mai 2011 um 18:53 geschrieben:
> 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 s
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
"José Mejuto" wrote in
message
> 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.
_
