Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted
(Nimrod -> Nim)
Line 1,456: Line 1,456:
</pre>
</pre>


=={{header|Nimrod}}==
=={{header|Nim}}==
<lang nimrod>proc insertSort[T](a: var openarray[T]) =
<lang nim>proc insertSort[T](a: var openarray[T]) =
for i in 1 .. <a.len:
for i in 1 .. <a.len:
let value = a[i]
let value = a[i]
Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Insertion_sort"