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 vote214 views1 answer
Haskell code
Haskell
0 vote216 views1 answer
Haskell merge lists
Haskell
2 votes228 views2 answers
Haskell or operator
Haskell
0 vote173 views1 answer
Haskell function
Haskell
1 vote223 views1 answer
Factorial program in haskell
Haskell
0 vote221 views1 answer
Point free style haskell
Haskell
3 votes217 views1 answer
Haskell multiline comment
Haskell
0 vote200 views1 answer
Concat two integers haskell
Haskell
0 vote165 views1 answer
Can you partially define a tuple in haskell
Haskell
0 vote182 views1 answer
Words haskell code
Haskell