Question

Write a C++ program to fill a vector with 5000 random numbers. Then display:

• The smallest number
• The largest number
• The number of odd values
• The number of even values
• The total of the values
• The average of the values
• Ask the user for an integer and display the subscript of the cell where it was found or NOT FOUND! if it isn’t found.

There is a file called "Activity 25 Sort functions.zip" under Materials in this week’s module. Download and unzip the shellSort and swapper function. Since you will be using a binary search, the vector will have to be in order.

Each of the preceding values should be determined by a function and returned to main where they should be displayed.

The c. C:\Windows\system32\cmd.exe The smallest number is 12 The largest number is 32766 number of evens is 2545 The number of odds is 2454 The total of the values is 82484206 The average of the values is 16496.84 Enter an integer: 781 781 was found at position 120 Press any key to continue

shellShort doc:

void sort(vector<string>& names)

{

bool flag = true;

int i, numLength = names.size();

int d = numLength;

while (flag || (d>1)) // bool flag

{

flag = false; //reset flag to 0 to check for

// future swaps_     

d = (d + 1) / 2;

for (i = 0; i < (numLength - d); i++)

{

if (names[i + d] < names[i])

{

swapper(names[i], names[i + d]);

flag = true; //tells swap has occurred

}

}

}

}

Activity 25 Sort functions.zip

void shellSort(vector<int>& V)
{
   bool flag = true;
   int i, numLength = V.size();

   int d = numLength;
   while (flag || (d>1))    // bool flag 
   {
      flag = false;  //reset flag to 0 to check for
      // future swaps
      d = (d + 1) / 2;
      for (i = 0; i < (numLength - d); i++)
      {
         if (V[i + d] < V[i])
         {
            swapper(V[i], V[i + d]);

            flag = true;     //tells swap has occurred
         }
      }
   }
}
void swapper(int &a, int &b)
{
   int temp;
   temp = a;
   a = b;
   b = temp;
}

REQUIREMENTS:

- must use comments

- must be in C++

Answer 1

#include <iostream>
#include <vector>
#include <cstdlib>
#include <ctime>

using namespace std;

void swapper(int& a, int& b)
{
    int temp;
    temp = a;
    a = b;
    b = temp;
}

void shellSort(vector<int>& V)
{
    bool flag = true;
    int i, numLength = V.size();

    int d = numLength;
    while (flag || (d > 1)) // bool flag
    {
        flag = false; //reset flag to 0 to check for
        // future swaps
        d = (d + 1) / 2;
        for (i = 0; i < (numLength - d); i++) {
            if (V[i + d] < V[i]) {
                swapper(V[i], V[i + d]);

                flag = true; //tells swap has occurred
            }
        }
    }
}

int smallest(vector<int> &vec) {
   int num = vec[0];
   for(int i = 0; i < vec.size(); ++i) {
       if(vec[i] < num) {
           num = vec[i];
       }
   }
   return num;
}

int largest(vector<int> &vec) {
   int num = vec[0];
   for(int i = 0; i < vec.size(); ++i) {
       if(vec[i] > num) {
           num = vec[i];
       }
   }
   return num;
}

int total(vector<int> &vec) {
   int sum = 0;
   for(int i = 0; i < vec.size(); ++i) {
       sum += vec[i];
   }
   return sum;
}

double average(vector<int> &vec) {
   return total(vec) / (double)vec.size();
}

int odd_count(vector<int> &vec) {
   int num = 0;
   for(int i = 0; i < vec.size(); ++i) {
       if(vec[i] % 2 == 1) {
           num++;
       }
   }
   return num;
}

int even_count(vector<int> &vec) {
   int num = 0;
   for(int i = 0; i < vec.size(); ++i) {
       if(vec[i] % 2 == 0) {
           num++;
       }
   }
   return num;
}

int bin_search(vector<int> &vec, int num) {
   int left = 0, right=vec.size()-1;
   while(left <= right) {
       int mid = (left+right)/2;
       if(vec[mid] == num) {
           return mid;
       } else if(num < vec[mid]) {
           right = mid-1;
       } else {
           left = mid+1;
       }
   }
   return -1;
}

int main() {
   srand(time(NULL));
   vector<int> vec;
   for(int i = 0; i < 5000; ++i) {
       vec.push_back(rand()%1000);
   }
   cout << "Smallest number is " << smallest(vec) << endl;
   cout << "Largest number is " << largest(vec) << endl;
   cout << "Number of odd values is " << odd_count(vec) << endl;
   cout << "Number of even values is " << even_count(vec) << endl;
   cout << "Total of values is " << total(vec) << endl;
   cout << "Average of values is " << average(vec) << endl;
   shellSort(vec);
   cout << "Enter a number to search for in vector: ";
   int num;
   cin >> num;
   int ind = bin_search(vec, num);
   if(ind == -1) {
       cout << num << " is not found in vector" << endl;
   } else {
       cout << num << " is found at index " << ind << endl;
   }
   return 0;
}

Smallest number is 0 Largest number is 999 Number of odd values is 2493 Number of even values is 2507 Total of values is 2460981 Average of values is 492.196 Enter a number to search for in vector: 155 155 is found at index 809 Process exited after 3.291 seconds with return value a Press any key to continue

Comment