Rearrange Related Data at Same Time

/* Sort A[0..m] into non-decreasing order, and rearrange B[0..m] similarly. */

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

{

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

{

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

finish A[0..k]; rearrange B similarly. */

int minLoc; // subscript of

// smallest in A[k..m]

/* Set minLoc so A[minLoc] is

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

minLoc = k;

for (int i=k+1; i <= m; i++)

if (A[i] < A[minLoc])

minLoc = i;

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

{

int temp = A[k];

A[k] = A[minLoc];

A[minLoc] = temp;

}

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

{

int temp = B[k];

B[k] = B[minLoc];

B[minLoc] = temp;

}

}

}

Previous slide

Back to first slide

View graphic version