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

3 votes219 views2 answers
First element in list haskell
Haskell
0 vote231 views1 answer
Remove nth element from list haskell
Haskell
0 vote154 views1 answer
Drop haskell
Haskell
0 vote159 views1 answer
Haskell list element at index
Haskell
1 vote225 views1 answer
Factorial program in haskell
Haskell
0 vote224 views1 answer
\n dont work in haskell
Haskell
5 votes220 views2 answers
Last element of list haskell
Haskell
5 votes226 views2 answers
Haskell get last element of list
Haskell
0 vote230 views1 answer
Haskell split a list at position n
Haskell
0 vote226 views1 answer
Haskell merge lists
Haskell