Sorting algorithms/Insertion sort: Difference between revisions

Line 2,024:
sub fill
 
letfor i = 0 to size - 1
 
do
 
let list[i] = int: (rnd) * 100
let i = i + 1
 
loopnext i < size
 
return
Line 2,037 ⟶ 2,034:
sub sort
 
letfor i = 1 to size - 1
 
do
 
let value = list[i]
Line 2,049 ⟶ 2,044:
 
let p = j + 1
 
let list[p] = list[j]
let j = j - 1
Line 2,059 ⟶ 2,053:
let p = j + 1
let list[p] = value
let i = i + 1
 
wait
 
loopnext i < size
 
return
Line 2,069 ⟶ 2,062:
sub show
 
letfor i = 0 to size - 1
 
do
 
print i, ": ", list[i]
let i = i + 1
next i
 
loop i < size
 
return</syntaxhighlight>
305

edits