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

5 votes245 views2 answers
Last element of list haskell
Haskell
0 vote246 views1 answer
Haskell split a list at position n
Haskell
1 vote238 views1 answer
Haskell fibonacci
Haskell
0 vote203 views1 answer
Concat two integers haskell
Haskell
4 votes249 views2 answers
INFRAME CODE
Haskell
0 vote163 views1 answer
Haskell function
Haskell
0 vote241 views1 answer
\n dont work in haskell
Haskell
18 votes241 views4 answers
Client does not support authentication protocol requested by server; consider upgrading MySQL client
Haskell
0 vote175 views1 answer
Haskell any function
Haskell
0 vote167 views1 answer
Haskell int to text
Haskell