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 vote197 views1 answer
Haskell function
Haskell
5 votes245 views3 answers
Get tail of list haskell
Haskell
0 vote239 views1 answer
Cabal package from GitHub
Haskell
4 votes191 views2 answers
Haskell append to list
Haskell
1 vote247 views1 answer
Haskell fibonacci
Haskell
0 vote192 views1 answer
Can you partially define a tuple in haskell
Haskell
0 vote205 views1 answer
Haskell return false if list empty
Haskell
0 vote256 views1 answer
Point free style haskell
Haskell
0 vote214 views1 answer
Drop haskell
Haskell
0 vote240 views1 answer
Haskell string split
Haskell