Algorithms Quicksort suggest change

Haskell Implementation

quickSort :: Ord a => [a] -> [a]
quickSort [] = []
quickSort (x:xs) = quickSort [ y | y <- xs, y <= x ] 
                   ++ [x] 
                   ++ quickSort [ z | z <- xs, z > x ]

Feedback about page:

Feedback:
Optional: your email if you want me to get back to you:



Table Of Contents