Quicksort in haskell

quicksort :: Ord a => [a] -> [a]
quicksort []     = []
quicksort (p:xs) = (quicksort lesser) ++ [p] ++ (quicksort greater)
    where
        lesser  = filter (< p) xs
        greater = filter (>= p) xs

Source: wiki.haskell.org

Similar codes

1 vote271 views1 answer
Haskell fibonacci
Haskell
2 votes312 views2 answers
Haskell guards
Haskell
1 vote273 views1 answer
Get first char from string haskell
Haskell
0 vote228 views1 answer
Can't do a reify in the IO monad
Haskell
0 vote286 views1 answer
Haskell split a list at position n
Haskell
1 vote283 views1 answer
Haskell code
Haskell
0 vote249 views1 answer
Concat two integers haskell
Haskell
0 vote309 views1 answer
\n dont work in haskell
Haskell
0 vote229 views1 answer
Haskell any function
Haskell
5 votes270 views2 answers
Last element of list haskell
Haskell