/** This program implements and illustrates Selection Sort - a very simple sorting algorithm using an array. Selection sort repeatedly scans the array to find the smallest value. Every time the smallest value is placed in its final position. 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 SelectionSort(); /* see 3 */ void swap(int one, int two); /* see 4 */ void printMyArray(int, int); /* see 5 */ int main(){ cout << "Array values before sorting: " << endl; printMyArray(-1,-1); /* see 6 */ cout << endl; SelectionSort(); /* see 7 */ cout << "\nThe array has been sorted."; return 0; } // end main void SelectionSort() { /* see 8 */ int min; for(int i=0; i

Selection Sort - using an array - with comments