Question

Mini-Recitation #2 – Due 02Dec (Monday)
It is simpler than a full recitation and therefore is worth only half as much (50 points instead of 100). It is due today but if it is presented at the beginning of Wednesday’s class, it will still be accepted for a slightly lower grade. This is a partner exercise so be prepared to work together with your partner.
This program will test your knowledge of single-dimension arrays and their search. Your program will create an array of 100 integers, fill it with 100 random values and then search for the third-largest and the third smallest values in the array.
Definition of “third-largest” value: find the largest value in the array and call it x. Then find the largest value that is smaller than x and call it y. find the largest value that is smaller than y and that is the third-largest value.
In this program you will use the random number generator to fill the array with 2-digit values ( 0 to 99). Then you will find the third-largest value in the array and the number of array elements containing that number. Find the third-smallest value in the array and the number of array elements containing that value. Display the values and their counts in an appropriate message.

C++ please

Answer 1

-------------------- I used Visual Studio 2013, C++ Language, Console Application --------------------

-------------------- OUTPUT --------------------

-------------------- CODE --------------------

#include "stdafx.h"
#include <iostream>
#include <time.h>
using namespace std;

int thirdLargestNumber(int arr[]);
int thirdSmallestNumber(int arr[]);
int howManyContains(int arr[], int number);
const int arraySize = 100;

int main()
{
   srand(time(NULL));
   int arr[arraySize];

   for (int i = 0; i < arraySize; i++)
   {
       int random = rand() % 100;
       arr[i] = random;
   }
   int thirdLargestNum = thirdLargestNumber(arr);
   int thirdSmallestNum = thirdSmallestNumber(arr);
   cout << "Third Largest Number : " << thirdLargestNum << endl;
   cout << "Third Smallest Number : " << thirdSmallestNum << endl;
   int noOfThirdLargestNumber = howManyContains(arr, thirdLargestNum);
   int noOfThirdSmallestNumber = howManyContains(arr, thirdSmallestNum);
   cout << "No of Third Largest Number present in array : " << noOfThirdLargestNumber << endl;
   cout << "No of Third Smallest Number present in array : " << noOfThirdSmallestNumber << endl;
   system("pause");
   return 0;
}

int thirdLargestNumber(int arr[])
{
   // Initialize first, second and third Largest element
   int first = arr[0], second = 0, third = 0;

   // Loop through the array starting at index 1
   for (int i = 1; i < arraySize; i++)
   {
       /* If current element is greater than first,
       then update first, second and third */
       if (arr[i] > first)
       {
           third = second;
           second = first;
           first = arr[i];
       }

       /* If arr[i] is in between first and second */
       else if (arr[i] > second)
       {
           third = second;
           second = arr[i];
       }

       /* If arr[i] is in between second and third */
       else if (arr[i] > third)
           third = arr[i];
   }

   return third;
}

int thirdSmallestNumber(int arr[])
{
   int first = arr[0], second = 0, third = 0;
   for (int i = 0; i < arraySize; i++)
   {
       /* Check if current element is less than
       first, then update first, second and
       third */
       if (arr[i] < first)
       {
           third = second;
           second = first;
           first = arr[i];
       }

       /* Check if current element is less than
       second then update second and third */
       else if (arr[i] < second)
       {
           third = second;
           second = arr[i];
       }

       /* Check if current element is less than
       third then update third */
       else if (arr[i] < third)
           third = arr[i];
   }

   return third;
}

int howManyContains(int arr[], int number)
{
   int count = 0;
   for (int i = 0; i < arraySize; i++)
   {
       /*If number is equal with array element,
       increment the count*/
       if (arr[i] == number)
       {
           count++;
       }
   }
   return count;
}