preview

Nt1330 Unit 3 Assignment 1

Decent Essays
Open Document

using namespace std; // I like using this, so I don't have to type std a million times while coding, though I hear it isn't best practice #include // import this so I can use cin/cout int arr[10]; // defining array max size int n; // n variable for for loop iterations void SelectionSort(int arr[], int n) //the actual sort { cout << "How many numbers do you wish to sort? (Max: 10) \n"; // user defines value of n cin >> n; while (n>10) // checks that value of n does not exceed max allowed array size { cout << "Sorry, too many numbers. How about a smaller amount? (Max: 10)"; cin >> n; }; cout << "Type the numbers to be sorted, one at a time.";// asks for input for (int i=0; i> arr[i]; }; int min,temp;// defining sort specific variables for (int i=0; i < n-1; i++)// defines i = 0, compares i to one less than n, increments i each iteration { min = i;// defines i = 0 as min to start for (int j=i+1; j < n; j++)// defines j as one larger than i, compares j to n, increments j each iteration { if (arr[j] < arr[min])// if j is less than min (defined as i, redefines the value of min to j, making it the new min min=j; }; if (min != i)// if min was redefined, swaps the values of the i and min …show more content…

The reason why it has this growth for best, average, and worst cases however is because of the way the sort itself works. It compares the “smallest” (first index at first iteration) value it has to every single other element in the array. Every time it finds a smaller, it redefines it as smallest, then once it is finished comparing makes a swap. It then repeats the process from the 2nd index, and once again compares it to every single proceeding element. It repeats this until the list is sorted. It even does this even if there is no sorting to be done, hence, always the same order of

Get Access
Related
Get Access