7 ms·

I'm surprised this is missing the canonical quicksort in one line of Haskell

• danieldk 15y ago
  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://augustss.blogspot.com/2007/08/quicksort-in-haskell-qu...
  • 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.
• omaranto 15y ago
  It's because this post is part of a meme: someone wrote a post with precisely this list of 10 one liners in some language (Scala, I think) and then several others have written translations to other languages.