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 vote369 views1 answer
Haskell function
Haskell
2 votes565 views2 answers
Haskell guards
Haskell
0 vote434 views1 answer
Cabal package from GitHub
Haskell
1 vote489 views1 answer
Remove first element list haskell
Haskell
3 votes505 views2 answers
First element in list haskell
Haskell
0 vote481 views1 answer
Haskell split a list at position n
Haskell
0 vote434 views1 answer
Haskell is element in list
Haskell
5 votes510 views2 answers
Haskell get last element of list
Haskell
0 vote355 views1 answer
Can you partially define a tuple in haskell
Haskell
0 vote413 views1 answer
Words haskell code
Haskell