// Steven Steele Math 233 #include #include #include using namespace std; const int size_of_v = 100; void reverse(std::vector &v) { int n = v.size()-1, b = 0; for(;b &v) { int i, j, first, temp; for(i=0; i=i; j--) { if(v[j] < v[first]) first = j;//swap subscript of the smallest item } temp = v[first]; v[first] = v[i]; v[i] = temp; } } void BubbleSort(std::vector &v) { for (int pass=1; pass < size_of_v; pass++) { // count how many times // This next loop becomes shorter and shorter for (int i=0; i < size_of_v-pass; i++) { if (v[i] > v[i+1]) { // exchange elements int temp = v[i]; v[i] = v[i+1]; v[i+1] = temp; } } } } void InsertionSort(std::vector &v) { int i, j, key; for(j = 1; j < size_of_v; j++) // Start with 1 (not 0) { key = v[j]; for(i = j - 1; (i >= 0) && (v[i] < key); i--) // Smaller values move up { v[i+1] = v[i]; } v[i+1] = key; //Put key into its proper location } reverse(v); } void ReRandomize (std::vector &v) { //shuffle existing array std::random_shuffle(v.begin(), v.end()); for (int i=0; i v; //initialize 0 - 100 array for (int i=0; i> c; switch (c) { case 'v': //reverse order reverse (v); for (int i=0; i