i = 0; while ( i < N && ... ) i++;
M = X[0]; for ( k=1; k<N; k++ ) if ( ... ) M = X[k];
M = 0; for ( k=1; k<N; k++ ) if ( X[k] > X[M] ) ...
p = X[a]; ... X[b] = p;
nR = -1; for ( k=0; k<N; k++ ) if ( X[k] == R ) { ... break; }
for ( k=0; k<...; k++ ) { c = X[k]; X[k] = X[N-1-k]; X[N-1-k] = c; }
c = X[N-1]; for ( k=N-1; k>0; k-- ) { ... } X[0] = c;
c = 0; for ( k=0; k<N; k++ ) if ( A[k] < 0 ) { ... c++; }