Rosetta Code

Sorting algorithms/Selection sort: Difference between revisions

Page Discussion

Sorting algorithms/Selection sort (view source)

Revision as of 05:40, 1 December 2016

87 bytes removed ,  7 years ago
→‎{{header|Haskell}}: don't need to reimplement delete
m (→‎{{header|Sidef}}: minor code improvements)
(→‎{{header|Haskell}}: don't need to reimplement delete)
Line 1,034:
 
=={{header|Haskell}}==
<lang haskell>selSortimport ::Data.List (Ord adelete) => [a] -> [a]
 
selSort :: (Ord a) => [a] -> [a]
selSort [] = []
selSort xs = let x = maximum xs in selSort (removedelete x xs) ++ [x]
where removex _= [] =maximum []xs</lang>
remove a (x:xs)
| x == a = xs
| otherwise = x : remove a xs
</lang>
 
=={{header|Haxe}}==
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/88650"