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

0 vote176 views1 answer
Haskell function
Haskell
3 votes257 views1 answer
Haskell multiline comment
Haskell
1 vote250 views1 answer
Haskell code
Haskell
5 votes264 views3 answers
Get tail of list haskell
Haskell
0 vote215 views1 answer
Concat two integers haskell
Haskell
0 vote171 views1 answer
Can't do a reify in the IO monad
Haskell
4 votes189 views2 answers
Append list haskell
Haskell
0 vote190 views1 answer
Haskell list element at index
Haskell
1 vote259 views1 answer
Factorial program in haskell
Haskell
0 vote192 views1 answer
Haskell any function
Haskell