Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 04:39, 20 February 2010
, 14 years ago→{{header|PL/I}}
Line 451:
=={{header|PL/I}}==
<lang pli>
INSSORT: PROCEDURE (A);
DCL
DCL (I, J, V, N) FIXED BIN(31);
DO I=2 TO N;▼
N = HBOUND(A,1); M = LBOUND(A,1);
V=A(I);
J=I-1;
DO WHILE (J >
if A(J) <= V then leave;
A(J+1)=A(J); J=J-1;
Line 465 ⟶ 467:
END;
RETURN;
END INSSORT;
</lang>
=={{header|Prolog}}==
| |||