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 vote384 views1 answer
Words haskell code
Haskell
0 vote394 views1 answer
Fibnocci code in haskell language
Haskell
0 vote346 views1 answer
Haskell function
Haskell
0 vote421 views1 answer
Haskell merge lists
Haskell
0 vote451 views1 answer
Haskell split a list at position n
Haskell
2 votes517 views2 answers
Haskell guards
Haskell
1 vote455 views1 answer
Remove first element list haskell
Haskell
0 vote389 views1 answer
Haskell return false if list empty
Haskell
3 votes441 views1 answer
Haskell multiline comment
Haskell
5 votes450 views3 answers
Get tail of list haskell
Haskell