Question

Write an object-oriented C++ program (i.e. a class and a main function to use it), using pointer variables, that program that performs specific searching and sorting exercises of an array of integers.

This program has six required outputs.

Start by initializing an array with the following integers, in this order:

23, 17, 5, 90, 12, 44, 38, 84, 77, 3, 66, 55, 1, 19, 37, 88, 8, 97, 25, 50, 75, 61, and 49.

Your array input may be hardcoded in your program if you wish, or you may input your data from a file.

After initializing your array in main, create a class instance and pass the array to the instance where the unsorted values are displayed. This is required output #1 of 6 for this program. Be sure to label it as such in your program output.

Using a linear, or sequential, search of the unsorted array, determine and report the 1-relative (i.e. 1st, 2nd, 3rd, 4th, etc.) positions of the following numbers in the array (or “not found”), and the number of searches that were required to locate the numbers: 25, 30, 50, 75, and 92. This is required output #2 of 6. Label this output.

Then display the total number of searches for all five numbers (i.e. the number of searches for 25, plus the number of searches for 30,…, plus the number of searches for 92). If a number wasn’t found, then add in the total elements in the array for that search attempt, since they would all have been searched. This is required output #3 of 6. Label this output.

Then sort the numbers using a bubble sort and display the sorted array. This is required output #4 of 6. Label this output.

Next, using a binary search of the sorted array, determine and report the 1-relative positions of the following numbers in the array (or “not found”), and the number of individual searches required to locate the numbers: 25, 30, 50, 75, and 92. This is required output #5 of 6. Label this output.

Finally, display the total number of searches for all five numbers, in the same manner as Step #3. This is required output #6 of 6. Label this output.

Make sure that you capture all six of your required outputs for this program's execution for full credit!

One strategy to develop this program is to first initialize an array with its values in main(). Then create an instance of a class (possibly named “ArrayHolder”) that receives the array of integers in its constructor. Your main() function could then call functions for each of the necessary search, sort, and display operations.

When passing arrays and results back and forth to your class instance you must use pointer variables.

Answer 1

Answer :

#include <iostream.h>

int arrayCount::search(std::vector<int> &arr, int term)
{
           for (int i = 0; i < arr.size(); ++i)
           { // iterate through array
               if (arr[i] == term)
               { // if term found
return ++i;
               }
           } // return 1-relative index of found term
return -1;
} // if loop doesn't find anything, return -1

void arrayCount::main(std::vector<std::wstring> &args)
{

   std::vector<int> arrayNum = {23, 17, 5, 90, 12, 44, 38, 84, 77, 3, 66, 55, 1, 19, 37, 88, 8, 97, 25, 50, 75, 61, 49};
       int numLocation;
       int numSearch = 0;
   std::wstring str = L"Unsorted values: ";
   // step 1
   for (int i = 0; i < arrayNum.size(); ++i)
   {
       str = str + std::wstring(L" ") + std::to_wstring(arrayNum[i]);
   }
   std::wcout << str << std::endl;
   // step 2
   std::vector<int> searches = {25,30,50, 75, 92}; // initialize numbers to search
   for (int i = 0; i < searches.size(); ++i)
   { // iterate through searches array
       numLocation = search(arrayNum, searches[i]);
       std::wcout << std::wstring(L"Search for ") << searches[i] << std::wstring(L": ") << numLocation << std::endl; // print search term and
               if (numLocation >= 0)
               {
                   numSearch = numSearch + numLocation;
               std::wcout << std::wstring(L"Number of searches ") << numLocation << std::endl;
               }
               else
               {
                   numSearch = numSearch + arrayNum.size();
               std::wcout << std::wstring(L"Number of searches ") << arrayNum.size() << std::endl;
               }
   }
               std::wcout << std::wstring(L"Total Number of Searches ") << numSearch << std::endl; // result of search
           Arrays::sort(arrayNum);
           std::wstring two = L"Sorted values: ";
   // step 4
   for (int i = 0; i < arrayNum.size(); ++i)
   {
       two = two + std::wstring(L" ") + std::to_wstring(arrayNum[i]);
   }
   std::wcout << two << std::endl;
       std::vector<int> searchesTwo = {25,30,50,75,92};
       int numsearchTwo = 0;
       for (int i = 0; i < searchesTwo.size(); ++i)
       {
       numLocation = Arrays::binarySearch(arrayNum, searchesTwo[i]);
       numLocation = numLocation + 1;
       if (numLocation >= 0)
       {
           numsearchTwo = numsearchTwo + numLocation;
               std::wcout << std::wstring(L"Search for ") << searchesTwo[i] << std::wstring(L": ") << numLocation << std::endl;
       std::wcout << std::wstring(L"Number of searches ") << numLocation << std::endl;
       }
               else
               {
                   numsearchTwo = numsearchTwo + arrayNum.size();
               std::wcout << std::wstring(L"Search for ") << searchesTwo[i] << std::wstring(L": -1") << std::endl;
               std::wcout << std::wstring(L"Number of searches ") << arrayNum.size() << std::endl;
               }

       }
               std::wcout << std::wstring(L"Total Number of Searches ") << numsearchTwo << std::endl;

}