Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 14:12, 10 November 2009
, 14 years agoAdded Scala
(moved REALbasic to BASIC; changed RB markup to VB; added QBasic) |
(Added Scala) |
||
Line 529:
ary.insertionsort!
# => [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]</lang>
=={{header|Scala}}==
<lang scala>def insert(list: List[Int], value: Int) = list.span(_ < value) match {
case (lower, upper) => lower ::: value :: upper
}
def insertSort(list: List[Int]) = list.foldLeft(List[Int]())(insert)</lang>
=={{header|Scheme}}==
| |||