3 ms·

But the 'canonical quicksort' is not quicksort ;), just a slow look-alike: http://augustss.blogspot.com/2007/08/quicksort-in-haskell-quicksort-is.html http://a

• jrockway 15y ago
  No, it's quicksort. It's just not the best implementation of quicksort.
  • danieldk 15y ago
    No, it's not. First line of Hoare's 1962 paper describing quicksort: A description is given of a new method of sorting in the random access store of a computer The paper also emphasizes the use of in-place mutations in quicksort. The qsort one-liner uses lists, which are not random-access and cannot be modified in-place.