On 2009-12-18 20:39:08 +0100, Walter Bright <[email protected]> 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
