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 vote400 views1 answer
Haskell split a list at position n
Haskell
1 vote384 views1 answer
Haskell max function
Haskell
1 vote395 views1 answer
Haskell fibonacci
Haskell
2 votes409 views2 answers
Haskell or operator
Haskell
1 vote396 views1 answer
Factorial program in haskell
Haskell
0 vote239 views1 answer
Haskell any function
Haskell
0 vote207 views1 answer
Fibnocci code in haskell language
Haskell
0 vote228 views1 answer
Haskell is element in list
Haskell
1 vote401 views1 answer
Haskell code
Haskell
0 vote243 views1 answer
Haskell string split
Haskell