Question

I need a c++ code please.

32. Program. Write a program that creates an integer constant called SIZE and initialize to the size of the array you will be creating. Use this constant throughout your functions you will implement for the next parts and your main program. Also, in your main program create an integer array called numbers and initialize it with the following values (Please see demo program below): 68, 100, 43, 58, 76, 72, 46, 55, 92, 94, 73, 68, 85, 48, 47, 62, 56, 75, 60, 60, 59, 77, 40, 72, 73, 95, 90, 89, 73, 93

i) void printArray(const int [] numbers). This function accepts an array as its first argument and prints each value in the array.

ii) int getSum(const int [] numbers). This function accepts an array as its argument and returns the sum of all the values in the array.

iii) double getAverage(const int [] numbers). This function accepts an array as its argument and returns the average of all the values in the array.

iv) double getMedian(const int [] numbers). This function accepts an array and returns a double which is the median (middle element) or average of the 2 middle values. (Hint: sort the array to find the median element). Also, use pointer notation * instead of array [] notation in this function.

v) int getMinValue(const int [] numbers). This function accepts an array as its argument and returns the minimum value in the array.

vi) int getMaxValue(const int [] numbers). This function accepts an array as its argument and returns the maximum value in the array.

vii) void copyArray(int [] dstnumbers, const int [] srcnumbers). This function accepts 2 arrays arguments. This function copy the value of the elements from srcnumbers array to dstnumbers array.

viii) void sortIncrease(int [] numbers). This function accepts an array as its arguments and sorts the array in increasing order.

ix) void sortDecrease(int [] numbers). This function accepts an array as it’s arguments and sorts the array in decreasing order.

x) int findNumber(const int [] numbers, int number). This function returns the index location of the number found in the array. Otherwise, it returns -1.

xi) void printNumbersLessThan(const int [] numbers, int number). This function prints the numbers of in the array that are less than the number passed in to the function.

xii) void printNumberBiggerThan(const int [] numbers, int number). This function prints the numbers in the array that is greater than the number pass in to the function. Demonstrate each of the functions in this program. Please write the prototypes of the function above main and the definitions below your main program. Note if you don’t submit your source file and/or your program does not compile, you will not receive any credit for this question.

Answer 1

CODE:

#include<iostream>
using namespace std;
const int SIZE=30;
void printArray(const int numbers[]);
int getSum(const int numbers[]);                         //prototypes of functions
double getAverage(const int numbers[]);
double getMedian(int numbers[]);
int getMinValue(const int numbers[]);
int getMaxValue(const int numbers[]);
void copyArray(int dstnumbers[], const int srcnumbers[]);
void sortIncrease(int numbers[]);
void sortDecrease(int numbers[]);
int findNumber(const int numbers[], int number);
void printNumbersLessThan(const int numbers[], int number);
void printNumberBiggerThan(const int numbers[], int number);
int main()
{
   int number;
   int numbers[SIZE]={68,100,43,58,76,72,46,55,92,94,73,68,85,48,47,62,56,75,60,60,59,77,40,72,73,95,90,89,73,93};
   printArray(numbers);
   cout<<endl;
   cout<<"sum of the Array is:"<<getSum(numbers)<<endl;
   cout<<"Average of the Array is:"<<getAverage(numbers)<<endl;
   double m=getMedian(numbers);
   cout<<"median value is:"<<m<<endl;
   cout<<"Minimum value is:"<<getMinValue(numbers)<<endl;
   cout<<"Maximum value is:"<<getMaxValue(numbers)<<endl;
   cout<<"After sorting array in ascending order:- "<<endl;
   sortIncrease(numbers);
   cout<<endl;
   cout<<"After sorting array in decending order:- "<<endl;
   sortDecrease(numbers);
   cout<<endl;
   cout<<"Enter the number to find in array:";
   cin>>number;
   int l=findNumber(numbers,number);
   cout<<"The index of "<<number<<" is: "<<l<<endl;
   cout<<"Enter the number to print elements less than entered number:";
   cin>>number;
   printNumbersLessThan(numbers,number);
   cout<<endl;
   cout<<"Enter the number to print elements greater than entered number:";
   cin>>number;
   printNumberBiggerThan(numbers,number);
   cout<<endl;
   int dstnumbers[SIZE];
   cout<<"Copying numbers array to dstnumbers array: "<<endl;
   copyArray(dstnumbers,numbers);
  
}
void printArray(const int numbers[])           //definitions of functions below main function
{
   for(int i=0;i<SIZE;i++)
   {
       cout<<numbers[i]<<" ";      //printing elements
   }
}
int getSum(const int numbers[])
{
   int sum=0;
   for(int i=0;i<SIZE;i++)
   {
       sum=sum+numbers[i];    //calculating sum of the elements
   }
   return sum;  
}
double getAverage(const int numbers[])
{
   double sum=0,avg=0;
   for(int i=0;i<SIZE;i++)
   {
       sum=sum+numbers[i];
   }
   avg=sum/SIZE;    //calculating average of elements
   return avg;  
}
double getMedian(int numbers[])
{
   int *p=numbers;
   int temp=0,i=0,j=0;
   for(i=0;i<SIZE;i++)
   {
       for(j=0;j<SIZE-1;j++)
       {
           if(*(p+j)>*(p+(j+1)))
           {
               temp=*(p+j);
               *(p+j)=*(p+(j+1));
               *(p+(j+1))=temp;
           }
       }
   }
   int mid=SIZE/2;
   double median=(*(p+(mid-1))+*(p+(mid)))/2.0;
   return median;
}
int getMinValue(const int numbers[])
{
   int min=numbers[0];
   for(int i=0;i<SIZE;i++)
   {
       if(numbers[i]<=min)
       {
           min=numbers[i];   //logic for finding minimum value
       }
   }
   return min;
}
int getMaxValue(const int numbers[])
{
   int max=numbers[0];
   for(int i=0;i<SIZE;i++)
   {
       if(numbers[i]>=max)
       {
           max=numbers[i]; //logic for finding maximum value
       }
   }
   return max;
}
void copyArray(int dstnumbers[], const int srcnumbers[])
{
   for(int i=0;i<SIZE;i++)
   {
       dstnumbers[i]=srcnumbers[i]; //copying srcnumber array to dstnumbers array
   }
   for(int i=0;i<SIZE;i++)
   {
       cout<<dstnumbers[i]<<" ";
   }
}
void sortIncrease(int numbers[])
{
   int temp=0,i=0,j=0;
   for(i=0;i<SIZE;i++)    //logic for sorting ascending order
   {
       for(j=0;j<SIZE-1;j++)
       {
           if(numbers[j]>numbers[j+1])
           {
               temp=numbers[j];
               numbers[j]=numbers[j+1];
               numbers[j+1]=temp;
           }
       }
   }
   for(int i=0;i<SIZE;i++)
   {
       cout<<numbers[i]<<" ";
   }  
}
void sortDecrease(int numbers[])
{
   int temp=0,i=0,j=0;
   for(i=0;i<SIZE;i++)   //logic for sorting decending order
   {
       for(j=0;j<SIZE-1;j++)
       {
           if(numbers[j]<numbers[j+1])
           {
               temp=numbers[j];
               numbers[j]=numbers[j+1];
               numbers[j+1]=temp;
           }
       }
   }
   for(int i=0;i<SIZE;i++)
   {
       cout<<numbers[i]<<" ";
   }  
}
int findNumber(const int numbers[], int number)
{
   int flag=0,loc=0;
   for(int i=0;i<SIZE;i++)
   {
       if(number==numbers[i])     //logic for finding index of the number
       {
           flag=1;
           return i;
       }
   }
   if(flag==0)
   {
       return -1;
   }
}
void printNumbersLessThan(const int numbers[], int number)
{
   for(int i=0;i<SIZE;i++)
   {
       if(numbers[i]<number)
       {
           cout<<numbers[i]<<" ";
       }
   }
}
void printNumberBiggerThan(const int numbers[], int number)
{
   for(int i=0;i<SIZE;i++)
   {
       if(numbers[i]>number)
       {
           cout<<numbers[i]<<" ";
       }
   }
}

OUTPUT: