Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted
Line 1,829:
 
<lang Oforth>: insertionSort(a)
{
| l i j v |
ListBuffera new dup addAll(a)asListBuffer ->l
2 l size for: i [
l at(i) ->v
i 1 - ->j
while(j) [
l at(j) dup v <= ifTrue: [ drop break ]
j 1 + swap l put
j 1 - ->j
]
l put(j 1 +, v)
]
l ;</lang>
}</lang>
 
{{out}}
Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Insertion_sort"