Refine the Loop Body

/* Sort A[0..m] into non-decreasing order. */

public void sort(int[] A, int m)

{

. . .

for ( int k = 0; k < m; k++ )

{

/* Given that A[0..k-1] is finished,

finish A[0..k]. */

int minLoc; // subscript of

// smallest in A[k..m]

/* Set minLoc so A[minLoc] is

smallest in A[k..m]. */

. . .

/* Exchange A[k] and A[minLoc] */

. . .

}

. . .

}

Previous slide

Next slide

Back to first slide

View graphic version