Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
no edit summary
m (Fixed typo in Io source.) |
No edit summary |
||
Line 355:
-- *Main> insertionSort [6,8,5,9,3,2,1,4,7]
-- [1,2,3,4,5,6,7,8,9]</lang>
=={{header|HicEst}}==
<lang hicest>DO i = 2, LEN(A)
value = A(i)
j = i - 1
1 IF( j > 0 ) THEN
IF( A(j) > value ) THEN
A(j+1) = A(j)
j = j - 1
GOTO 1 ! no WHILE in HicEst
ENDIF
ENDIF
A(j+1) = value
ENDDO</lang>
=={{header|J}}==
| |||