// Created by Jade A on 2/10/19. // first successful run: 2/14/19 /*Ascending and Descending Orderering of Arrays arrays, for loops, nested for loops, functions Chapter 7, 7.2 C++ Without Fear, 3rd Edition (Overland) */ // //only works with copy/paste to C++ IDE. Will not work on sololearn platform. #include using namespace std; //function list void sortLtoH(int n); void sortHtoL(int n); void swap (int *p1, int *p2); int a[10]; //change array's length here int main() { /* for (int i=0; i<10; ++i) { //change array length cout << "Enter array element " << i+1 << "'s value: "; cin >> a[i]; } */ int x; cout << "Enter 10 values: "; for (x=0; x<10; ++x) { cin >> a[x]; } int response=1; cout <> response; while (response != 1 && response != 2) { cout << "Invalid response. Please enter 1 or 2: "; cin >> response; } if (response == 1) { sortLtoH(10); //change array length } if (response == 2) { sortHtoL(10); // change array length } cout << "Here is the sorted array: " << endl; for (int i=0; i<10; ++i) { //change array length cout << a[i] << " "; } int response2; cout << endl << "Sort the other way? 1=yes, 2=no: "; cin >> response2; while (response2 != 1 && response2 != 2) { cout << "Invalid response. Please enter 1 or 2: "; cin >> response; } if (response2==1 && response==1) { sortHtoL(10); // change array length cout << "Here is the sorted array: " << endl; for (int i=0; i<10; ++i) { //change array length cout << a[i] << " "; } } else if (response2==1 && response==2) { sortLtoH(10); //change array length cout << "Here is the sorted array: " << endl; for (int i=0; i<10; ++i) { //change array length cout << a[i] << " "; } } else { cout << endl;} return 0; } //sort low to high function // sort array a with n elements void sortLtoH (int n) { int low = 0; for (int i = 0; i < n-1; ++i) { //from a[0] to a[10] //loop part 1: find the lowest element in the range i to n-1 //index is set to variable named low low = i; for (int j = i+1; j < n; ++j){ //start at 0+1 --> 10 if (a[j] < a[low]){ low = j; } //cout << "low: " << low << " n: " << n << " "; } //loop part 2: swap if needed if (i != low) { swap(&a[i], &a[low]); } } } //sort high to low //sort array a with n elements void sortHtoL (int n) { int low = 0; for (int i = 0; i < n-1; ++i) { //from a[0] to a[10] //loop part 1: find highest element low = i; for (int j = i+1; j < n; ++j){ //start at 0+1 --> 10 if (a[low] < a[j]){ low = j; } //cout << "low: " << low << " n: " << n << " "; } //loop part 2: swap if needed if (i != low) { swap(&a[i], &a[low]); } } } //swap function //swap values pointed to by p1 and p2 void swap (int *p1, int *p2) { int temp = *p1; *p1 = *p2; *p2 = temp; }

Ordering Arrays (Successful)