// This program demonstrates a bubble sort
//
#include <iostream>
using namespace std;


int arrSize; // I cheated and used a global ... sorry


void bubbleSort(int [], long &);
int main()
{
   srand((unsigned)time(NULL));  // Seed the random number generator


   long totalSwaps = 0;
   cout << "Enter the size of the array please: ";
   cin >> arrSize;
   int *arr = new int[arrSize];


   for(int i=0; i<arrSize; i++)  // Load the array with random values
      arr[i] = rand();
   bubbleSort(arr, totalSwaps);
   cout << "Total swaps for random order = " << totalSwaps << endl;


   totalSwaps = 0;


   for(int j=0; j<arrSize; j++) // Load the array in reverse order
      arr[j] = arrSize - j;
   bubbleSort(arr, totalSwaps);
   cout << "Total swaps for reverse order = " << totalSwaps << endl;
}


// Bubble sort routine (very inefficient)
void bubbleSort(int inArr[], long &inTS)
{
   int temp;
   bool switchedAPair = true;
   while(switchedAPair)
   {
      switchedAPair = false;
      for(int k=0; k < arrSize-1; k++)
      {
         if(inArr[k] > inArr[k+1])
         {                          // Standard swap
            temp = inArr[k];        // Save one
            inArr[k] = inArr[k+1];  // Move the other one over
            inArr[k+1] = temp;      // Complete the swap
            inTS++;                 // Increment swap count
            switchedAPair = true;   // We need to go again
         }
      }
   }
}