Sorting algorithms/Insertion sort: Difference between revisions
→{{header|Common Lisp}}
(→OCaml: clean-up & simplify) |
Basicgames (talk | contribs) |
||
Line 2,010:
(cdr sequence)
predicate)))))</syntaxhighlight>
=={{header|Craft Basic}}==
<syntaxhighlight lang="basic">define size = 10, value = 0
dim list[size]
gosub fill
gosub sort
gosub show
end
sub fill
let i = 0
do
let list[i] = int: (rnd) * 100
let i = i + 1
loop i < size
return
sub sort
let i = 1
do
let value = list[i]
let j = i - 1
do
if j >= 0 and list[j] > value then
let p = j + 1
let list[p] = list[j]
let j = j - 1
endif
loop j >= 0 and list[j] > value
let p = j + 1
let list[p] = value
let i = i + 1
wait
loop i < size
return
sub show
let i = 0
do
print i, ": ", list[i]
let i = i + 1
loop i < size
return</syntaxhighlight>
=={{header|D}}==
| |||