Sorting algorithms/Insertion sort: Difference between revisions
m
→{{header|E}}
m (→{{header|E}}) |
|||
Line 1,126:
> a
# value: [10, 10, 10, 13, 14, 17, 22, 23, 24, 26, 27, 27, 39, 40, 47, 50, 52, 53, 54, 55, 59, 60, 61, 62, 63, 65, 67, 71, 75, 75, 78, 83, 85, 85, 88, 91, 93, 94, 96, 99].diverge()</lang>
=={{header|Easyprog.online}}==
<lang easyprog.online>subr sort
for i = 1 to len data[] - 1
h = data[i]
j = i - 1
while j >= 0 and h < data[j]
data[j + 1] = data[j]
j -= 1
.
data[j + 1] = h
.
.
data[] = [ 29 4 72 44 55 26 27 77 92 5 ]
call sort
print data[]</lang>
=={{header|Eiffel}}==
| |||