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

3 votes331 views2 answers
First element in list haskell
Haskell
5 votes311 views2 answers
Last element of list haskell
Haskell
1 vote331 views1 answer
Factorial program in haskell
Haskell
0 vote271 views1 answer
Haskell int to text
Haskell
0 vote252 views1 answer
Get string lenght haskell
Haskell
0 vote295 views1 answer
Fibnocci code in haskell language
Haskell
0 vote279 views1 answer
Words haskell code
Haskell
0 vote292 views1 answer
Concat two integers haskell
Haskell
0 vote318 views1 answer
Remove nth element from list haskell
Haskell
0 vote264 views1 answer
Delete a as haskell
Haskell