Rosetta Code

Sorting algorithms/Insertion sort: Difference between revisions

Page Discussion

Sorting algorithms/Insertion sort (view source)

Revision as of 11:54, 8 February 2024

1 byte added ,  3 months ago
m
→‎{{header|Wren}}: Minor tidy
imported>Arakov
m (→‎{{header|Wren}}: Minor tidy)
Line 5,215:
 
=={{header|Wren}}==
<syntaxhighlight lang="ecmascriptwren">var insertionSort = Fn.new { |a|
for (i in 1..a.count-1) {
var v = a[i]
Line 5,227:
}
 
var asarray = [ [4, 65, 2, -31, 0, 99, 2, 83, 782, 1], [7, 5, 2, 6, 1, 4, 2, 6, 3] ]
for (a in asarray) {
System.print("Before: %(a)")
insertionSort.call(a)
Line 5,246:
Alternatively we can just call a library method.
{{libheader|Wren-sort}}
<syntaxhighlight lang="ecmascriptwren">import "./sort" for Sort
 
var asarray = [ [4, 65, 2, -31, 0, 99, 2, 83, 782, 1], [7, 5, 2, 6, 1, 4, 2, 6, 3] ]
for (a in asarray) {
System.print("Before: %(a)")
Sort.insertion(a)
PureFox
9,476

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/348605"