i:=1; while (i<=N) and ( ... ) do i:=i+1;
M:=X[1]; for k:=2 to N do if ... then M := X[k];
M:=1; for k:=2 to N do if X[k]>X[M] then ...
p := X[a]; ... X[b] := p;
nR:= 0; for k:=1 to N do if X[k]=R then begin ... break end;
for k:=1 to ... do begin c:=X[k]; X[k]:=X[N+1-k]; X[N+1-k]:=c end;
c:=X[N]; for k:=N downto 2 do begin ... end; X[1]:=c;
c:=1; for k:=1 to N do if A[k]<0 then begin ... c:=c+1 end;