// Steve J. Hodges
// CS19: C++ Programming
// bubblesort.cpp

#include <iostream>
using namespace std;

// ascending order bubblesort 
void bubbleSort(int [], const int);


main(){
  const int ASIZE=11;
  int a[]={4,7,6,3,4,2,3,8,7,9,6};
  cout << "Bubblesort:" << endl;
  cout << "array: ";
  for(int i =0; i<ASIZE; i++){
    cout << a[i] << " ";
  }
  cout << endl;

  bubbleSort(a, ASIZE);

  cout << "After Sort:";

  for(int i =0; i<ASIZE; i++){
    cout << a[i] << " ";
  }
  cout << endl;
}

// bubble sort in ASCending order
void bubbleSort(int a[], const int AS){
  int temp;
  for(int i=AS-1; i>0; i--){
    for(int j=0; j<i; j++){
      if( a[j] > a[j+1]){
	temp = a[j+1];
	a[j+1]=a[j];
	a[j]=temp;
      }// if 
    }// for j
  for(int k =0; k<AS; k++){
    cout << a[k] << " ";
  }
  cout << endl;
  }// for i
}// end bubbleSort