Sorting algorithms/Insertion sort: Difference between revisions
Content added Content deleted
(Updated to work with version 1.4.) |
|||
| Line 2,787: | Line 2,787: | ||
=={{header|Nim}}== |
=={{header|Nim}}== |
||
<lang nim>proc insertSort[T](a: var openarray[T]) = |
<lang nim>proc insertSort[T](a: var openarray[T]) = |
||
for i in 1 .. |
for i in 1 .. a.high: |
||
let value = a[i] |
let value = a[i] |
||
var j = i |
var j = i |
||