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 vote150 views1 answer
Words haskell code
Haskell
5 votes236 views3 answers
Get tail of list haskell
Haskell
3 votes227 views2 answers
First element in list haskell
Haskell
5 votes227 views2 answers
Last element of list haskell
Haskell
0 vote159 views1 answer
Drop haskell
Haskell
0 vote232 views1 answer
Haskell merge lists
Haskell
0 vote154 views1 answer
Get string lenght haskell
Haskell
0 vote155 views1 answer
Can you partially define a tuple in haskell
Haskell
1 vote225 views1 answer
Haskell fibonacci
Haskell
5 votes233 views2 answers
Haskell get last element of list
Haskell