Re:Quicksort is the new Hello World
by Deestan on Saturday December 11, 2010 @07:26AM
(#1994695)
It is just a toy implementation. If we're going to worry about practicals, then it's not recommended to use your own general purpose sorting implementations at all. For general purpose sorting, the standard library "always" has the best implementation.
[ Parent
| on HN ]
Except it is also the canonical look-how-awesome-Haskell-is example that keeps getting trotted out all the time. Why aren't there more canonical examples of Haskell being both simple and awesome as well as fast and correct?