News for hackers. Stuff that matters.

A comment on Ask HN: What is the cleanest code sample you've seen?.

Re:Ask HN: What is the cleanest code sample you've seen? by e19293001 on Thursday September 15, 2016 @11:40PM (#12511672)
Quicksort in Haskell

    quicksort :: (Ord a) => [a] -> [a]  
    quicksort [] = []  
    quicksort (x:xs) =   
        let smallerSorted = quicksort [a | a <- xs, a <= x]  
            biggerSorted = quicksort [a | a <- xs, a > x]  
        in  smallerSorted ++ [x] ++ biggerSorted
Source: http://learnyouahaskell.com/recursion#hello-recursion
[ Parent | on HN ]
Re:Ask HN: What is the cleanest code sample you've seen? by tome on Friday September 16, 2016 @12:57AM (#12511935)
(Technically this is not quicksort, unless you're willing to be particularly broad with your definition of quicksort)
[ Parent | on HN ]