Difference between revisions of "Quicksort"
Jump to navigation
Jump to search
(No difference)
|
Revision as of 23:07, 19 December 2006
Cel mai simplu limbaj si cea mai scurta implementare de algoritm Quicksort
se poate face in Haskell astfel:
quick :: [Integer] -> [Integer]
quick [] = []
quick (h:t)= quick [ y | y <- t , y < h] ++ [h] ++ quick [ y | y <- t , y > h]