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 vote308 views1 answer
Haskell list element at index
Haskell
1 vote378 views1 answer
Factorial program in haskell
Haskell
2 votes407 views2 answers
Haskell guards
Haskell
0 vote293 views1 answer
Get string lenght haskell
Haskell
0 vote376 views1 answer
Haskell split a list at position n
Haskell
0 vote342 views1 answer
Cabal package from GitHub
Haskell
0 vote332 views1 answer
Concat two integers haskell
Haskell
18 votes361 views4 answers
Client does not support authentication protocol requested by server; consider upgrading MySQL client
Haskell
0 vote339 views1 answer
Haskell string split
Haskell
4 votes393 views2 answers
INFRAME CODE
Haskell