/** This program implements and illustrates Bubble Sort - a very simple sorting algorithm using an array.Bubble sort repeatedly scans the array and swaps adjacent values if they are not in order. At the end of each scan larger values 'bubble' up to their positions in the ordered array. Note: The output displays the content of the array after each swap. The two numbers involved are placed inside (). */ /** More comments can be found at the end of the code.*/ /** HAPPY LEARNING! */ /*************** CODE ************************/ #include #include using namespace std; int myArray[] = {7,2,4,2,9,5,6,1,5}; /* see 1 */ int arraySize = sizeof(myArray)/sizeof(myArray[0]); /* see 2 */ void BubbleSort(); /* see 3 */ void swap(int one, int two); /* see 4 */ void printMyArray(int, int); /* see 5 */ int main(){ cout << "Array values before sorting:\n"; printMyArray(-1,-1); /* see 6 */ cout << endl; BubbleSort(); /* see 7 */ cout << "\nThe array has been sorted."; return 0; } // end main void BubbleSort() { /* see 8 */ for(int i=0; i myArray[j+1]) swap(j, j+1); } } // end BubbleSort void swap(int one, int two) { /* see 9 */ int temp = myArray[one]; myArray[one] = myArray[two]; myArray[two] = temp; static int swapCount=1; cout << "Swap " << setw(2) << swapCount++ <<": "; printMyArray(one, two); }// end swap void printMyArray(int one, int two) { /* see 10 */ for(int j=0; j

Bubble Sort - using an array - with comments