Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 11:54, 8 February 2024
, 4 months ago→{{header|Wren}}: Minor tidy
imported>Arakov |
m (→{{header|Wren}}: Minor tidy) |
||
Line 5,215:
=={{header|Wren}}==
<syntaxhighlight lang="
for (i in 1..a.count-1) {
var v = a[i]
Line 5,227:
}
var
for (a in
System.print("Before: %(a)")
insertionSort.call(a)
Line 5,246:
Alternatively we can just call a library method.
{{libheader|Wren-sort}}
<syntaxhighlight lang="
var
for (a in
System.print("Before: %(a)")
Sort.insertion(a)
|