Difference between revisions of "Quicksort"
Jump to navigation
Jump to search
m |
|||
| Line 1: | Line 1: | ||
| − | + | Cea mai scurta implementare de algoritm Quicksort <br> |
|
se poate face in Haskell astfel: <br> <br> |
se poate face in Haskell astfel: <br> <br> |
||
<nowiki> |
<nowiki> |
||
| Line 6: | Line 6: | ||
quick [] = [] </nowiki> <br> <nowiki> |
quick [] = [] </nowiki> <br> <nowiki> |
||
quick (h:t)= quick [ y | y <- t , y < h] ++ [h] ++ quick [ y | y <- t , y > h] </nowiki> <br> |
quick (h:t)= quick [ y | y <- t , y < h] ++ [h] ++ quick [ y | y <- t , y > h] </nowiki> <br> |
||
| + | |||
| + | Versiunile in Pascal, C , C++, Java si alte "C-like languages" sunt cam de 10 ori mai lungi. |
||
Revision as of 23:08, 19 December 2006
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]
Versiunile in Pascal, C , C++, Java si alte "C-like languages" sunt cam de 10 ori mai lungi.