Jump to content

Sorting algorithms/Insertion sort: Difference between revisions

Line 453:
<lang pli>INSSORT: PROCEDURE (A,N);
DCL (A(*)) FIXED BIN(31),
N FIXED BIN(31) NONASGNNONASSIGNABLE;
DCL (I,J,V) FIXED BIN(31);
DO I=2 TO N;
V=A(I);
J=I-1;
DO WHILE (J > 0 & A(J) > V);
if A(J+1) <=A(J); J-=1V then leave;
A(J+1)=A(J); J=J-1;
END;
A(J+1)=V;
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.