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

18 votes230 views4 answers
Client does not support authentication protocol requested by server; consider upgrading MySQL client
Haskell
0 vote163 views1 answer
Haskell int to text
Haskell
0 vote235 views1 answer
Point free style haskell
Haskell
0 vote158 views1 answer
Can you partially define a tuple in haskell
Haskell
1 vote239 views1 answer
Factorial program in haskell
Haskell
2 votes248 views2 answers
Haskell guards
Haskell
0 vote240 views1 answer
Haskell split a list at position n
Haskell
1 vote244 views1 answer
Remove first element list haskell
Haskell
0 vote159 views1 answer
Haskell function
Haskell
5 votes234 views2 answers
Last element of list haskell
Haskell