/* implements exchange sort. Each pass is given by a function.  makes the code
   portable enough so that the bubble sort can be done by simply changing the
   function pass. */

#include<iostream.h>

const int NUM=10;

void pass(int[], int);
void print_array(int[]);

void main(){

  int a[NUM] = { 3, 7, 10, 1, 5, 0, 9, 12, 6, 4};

  print_array(a);

  for (int i=NUM; i>=2; i--)
    pass(a,i);
  /* note once we do pass for i=2, we are done */
}

void print_array(int b[]){

  for (int i=0; i<NUM; i++)
    cout << b[i] << " ";
  cout << endl;
}

/* implements each pass of the exchange sort.  The array indices we
   are passing through go from 0 to stop-1.
*/
void pass(int b[], int stop){  

  int max_val = b[0], where_max = 0;  /*initialize for i=0*/

  for (int j=1; j<stop; j++)
    if (b[j]>max_val){
      max_val = b[j];
      where_max = j;
    }

  b[where_max] = b[stop-1];
  b[stop-1] = max_val;         /* the slot we want is stop - 1, not stop */

  print_array(b);
}