Rosetta Code

Sorting algorithms/Insertion sort: Difference between revisions

Page Discussion

Sorting algorithms/Insertion sort (view source)

Revision as of 00:48, 21 August 2014

50 bytes added ,  9 years ago
Made sort generic so it works with any type containing an Ordering
(Made sort generic so it works with any type containing an Ordering)
Line 1,797:
 
=={{header|Scala}}==
<lang scala>def insertinsertSort[X](list: List[IntX],)(implicit valueord: IntOrdering[X]) = list.span(_ < value) match {
casedef insert(lowerlist: List[X], uppervalue: X) => lowerlist.span(x :::=> ord.lt(x, value)) ::match upper{
case (lower, upper) => lower ::: value :: upper
}
}
def insertSort(list: List[Int]) = list.foldLeft(List[Int]())(insert)</lang>
list.foldLeft(List.empty[X])(insert)
}</lang>
 
=={{header|Scheme}}==
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/42878"