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 vote195 views1 answer
Haskell string split
Haskell
0 vote160 views1 answer
Fibnocci code in haskell language
Haskell
0 vote166 views1 answer
Delete a as haskell
Haskell
0 vote251 views1 answer
Haskell merge lists
Haskell
3 votes247 views2 answers
First element in list haskell
Haskell
1 vote253 views1 answer
Factorial program in haskell
Haskell
1 vote246 views1 answer
String to list haskell
Haskell
0 vote171 views1 answer
Haskell function
Haskell
1 vote243 views1 answer
Haskell code
Haskell
18 votes244 views4 answers
Client does not support authentication protocol requested by server; consider upgrading MySQL client
Haskell