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

1 vote354 views1 answer
String to list haskell
Haskell
1 vote398 views1 answer
Int to float haskell
Haskell
0 vote330 views1 answer
Haskell string split
Haskell
5 votes341 views2 answers
Last element of list haskell
Haskell
3 votes366 views2 answers
First element in list haskell
Haskell
5 votes360 views2 answers
Haskell get last element of list
Haskell
0 vote331 views1 answer
Cabal package from GitHub
Haskell
1 vote360 views1 answer
Haskell code
Haskell
0 vote364 views1 answer
Haskell split a list at position n
Haskell
4 votes295 views2 answers
Haskell append to list
Haskell