Go rant

Daniel de Kok me at danieldk.eu
Mon Dec 21 09:27:13 PST 2009


On 2009-12-18 20:39:08 +0100, Walter Bright <newshound1 at digitalmars.com> said:
> Ain't that cool? But look closer. The advantage of quicksort is that it 
> is an *in-place* sort. The Haskell one creates new arrays for every 
> state in the sort.

But it does have one nice property: due to laziness, the n-th elements 
of the sorted array can be found without sorting the full array (except 
of course, the largest two n's).

-- Daniel




More information about the Digitalmars-d mailing list