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

4 votes414 views2 answers
INFRAME CODE
Haskell
4 votes326 views2 answers
Haskell append to list
Haskell
5 votes375 views2 answers
Last element of list haskell
Haskell
2 votes380 views2 answers
Haskell or operator
Haskell
0 vote316 views1 answer
Haskell list element at index
Haskell
1 vote391 views1 answer
Haskell code
Haskell
0 vote350 views1 answer
Cabal package from GitHub
Haskell
1 vote374 views1 answer
Get first char from string haskell
Haskell
0 vote394 views1 answer
Point free style haskell
Haskell
0 vote292 views1 answer
Can you partially define a tuple in haskell
Haskell