Sorting algorithms/Insertion sort: Difference between revisions
Content added Content deleted
Basicgames (talk | contribs) |
Basicgames (talk | contribs) |
||
| Line 2,024: | Line 2,024: | ||
sub fill |
sub fill |
||
for i = 0 to size - 1 |
|||
do |
|||
let list[i] = int: (rnd) * 100 |
let list[i] = int: (rnd) * 100 |
||
let i = i + 1 |
|||
next i |
|||
return |
return |
||
| Line 2,037: | Line 2,034: | ||
sub sort |
sub sort |
||
for i = 1 to size - 1 |
|||
do |
|||
let value = list[i] |
let value = list[i] |
||
| Line 2,049: | Line 2,044: | ||
let p = j + 1 |
let p = j + 1 |
||
let list[p] = list[j] |
let list[p] = list[j] |
||
let j = j - 1 |
let j = j - 1 |
||
| Line 2,059: | Line 2,053: | ||
let p = j + 1 |
let p = j + 1 |
||
let list[p] = value |
let list[p] = value |
||
let i = i + 1 |
|||
wait |
wait |
||
next i |
|||
return |
return |
||
| Line 2,069: | Line 2,062: | ||
sub show |
sub show |
||
for i = 0 to size - 1 |
|||
do |
|||
print i, ": ", list[i] |
print i, ": ", list[i] |
||
let i = i + 1 |
|||
next i |
|||
loop i < size |
|||
return</syntaxhighlight> |
return</syntaxhighlight> |
||