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 vote406 views1 answer
Words haskell code
Haskell
0 vote432 views1 answer
Can't do a reify in the IO monad
Haskell
0 vote350 views1 answer
Can you partially define a tuple in haskell
Haskell
0 vote417 views1 answer
Haskell any function
Haskell
0 vote474 views1 answer
Remove nth element from list haskell
Haskell
2 votes557 views2 answers
Haskell guards
Haskell
1 vote483 views1 answer
Haskell code
Haskell
4 votes509 views2 answers
INFRAME CODE
Haskell
0 vote383 views1 answer
Delete a as haskell
Haskell
0 vote426 views1 answer
Cabal package from GitHub
Haskell