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 vote468 views1 answer
Haskell max function
Haskell
0 vote458 views1 answer
Haskell split a list at position n
Haskell
4 votes393 views2 answers
Haskell append to list
Haskell
1 vote462 views1 answer
Haskell code
Haskell
1 vote491 views1 answer
Int to float haskell
Haskell
1 vote463 views1 answer
Factorial program in haskell
Haskell
4 votes489 views2 answers
INFRAME CODE
Haskell
1 vote448 views1 answer
String to list haskell
Haskell
0 vote371 views1 answer
Haskell list element at index
Haskell
0 vote410 views1 answer
Haskell is element in list
Haskell