Sorting algorithms/Insertion sort: Difference between revisions
Content added Content deleted
PatGarrett (talk | contribs) m (→{{header|360 Assembly}}: add a comment) |
|||
Line 1,829:
<lang Oforth>: insertionSort(a)
| l i j v |
2 l size for: i [
l at(i) ->v
i 1
while(j) [
l at(j) dup v <= ifTrue: [ drop break ]
j 1
j 1
]
l put(j 1 +, v)
]
l ;</lang>
{{out}}
|