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 vote259 views1 answer
Get first char from string haskell
Haskell
5 votes254 views2 answers
Last element of list haskell
Haskell
1 vote303 views1 answer
Int to float haskell
Haskell
1 vote254 views1 answer
Haskell fibonacci
Haskell
0 vote256 views1 answer
Haskell merge lists
Haskell
1 vote274 views1 answer
Remove first element list haskell
Haskell
0 vote226 views1 answer
Drop haskell
Haskell
0 vote238 views1 answer
Fibnocci code in haskell language
Haskell
2 votes291 views2 answers
Haskell guards
Haskell
3 votes269 views2 answers
First element in list haskell
Haskell