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

2 votes421 views2 answers
Haskell guards
Haskell
0 vote235 views1 answer
Can you partially define a tuple in haskell
Haskell
5 votes403 views2 answers
Last element of list haskell
Haskell
0 vote404 views1 answer
Point free style haskell
Haskell
0 vote224 views1 answer
Words haskell code
Haskell
2 votes427 views2 answers
Haskell or operator
Haskell
4 votes421 views2 answers
INFRAME CODE
Haskell
0 vote227 views1 answer
Haskell function
Haskell
0 vote242 views1 answer
Drop haskell
Haskell
0 vote226 views1 answer
Delete a as haskell
Haskell