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 vote131 views1 answer
Cabal package from GitHub
Haskell
1 vote211 views1 answer
Remove first element list haskell
Haskell
0 vote134 views1 answer
Delete a as haskell
Haskell
5 votes202 views2 answers
Last element of list haskell
Haskell
0 vote206 views1 answer
\n dont work in haskell
Haskell
4 votes136 views2 answers
Append list haskell
Haskell
1 vote203 views1 answer
Factorial program in haskell
Haskell
1 vote197 views1 answer
Haskell code
Haskell
0 vote132 views1 answer
Get string lenght haskell
Haskell
3 votes201 views2 answers
First element in list haskell
Haskell