Question

please help urgent c++

Use the vector/array below for the following tasks: {25, 39, 12, 85, 55, 69, 40, 75} Task1 - [2 points] Put your name on the top comment section as the author of this code. For example, // Author: (Your name] Task2 – [5 points] Display (cout) the elements that are greater than 40 in the array. Task 3 - [5 points] Sort the given input array in an ascending order using any sort algorithm learned from the course (insertion sort, quick sort or merge sort). Task 4 - [5 points] After the array is sorted, use binary search to search for the numbers 5 and 75 in the array. Task 5- [10 points] Use the array from Task3 to output the first five largest elements in the array. The output for your code for tasks 2 to 5 should look exactly as shown below: Output for Task 2 Numbers greater than 40 are 85 55 69 75 Output for Task 3 My vector is : 25 39 12 85 55 69 40 75 My sorted vector is : 12 25 39 40 55 69 75 85 Output for Task 4 Find 5 5 cannot be found! Find 75 75 can be found at index : 6 Output for Task 5 Five largest elements are : 85 75 69 55 40 CELETL

Answer 1

For the following program, Arrays are used to perform the following given tasks

Program:

#include <iostream>

using namespace std;
int binarySearch(int arr[], int l, int r, int x)
{
while (l <= r) {
int m = l + (r - l) / 2;
if (arr[m] == x)
return m;
if (arr[m] < x)
l = m + 1;
else
r = m - 1;
}
return -1;
}
int main()
{
int array[]={25,39,12,85,55,69,40,75};
int grt40[8];
int count=0;
for(int i=0;i<8;i++)
{
if(array[i]>40)
{
grt40[count]=array[i];
count++;
}
}
cout<<"Output for Task 2"<<endl;
cout<<"Numbers greater than 40 are ";
for(int i=0;i<count;i++)
{
cout<<grt40[i]<<" ";
}
cout<<"\n\nOutput for Task 3";
cout<<endl<<"My vector is :"<<endl;
for(int i=0;i<8;i++)
{
cout<<array[i]<<" ";
}
cout<<endl<<"My sorted vector is : "<<endl;
int key, j;
for(int i = 1; i<8; i++)
{
key = array[i];//take value
j = i;
while(j > 0 && array[j-1]>key)
{
array[j] = array[j-1];
j--;
}
array[j] = key; //insert in right place
}
for(int i=0;i<8;i++)
{
cout<<array[i]<<" ";
}
cout<<"\n\nOutput for Task 4";
cout<<endl<<"Find 5";
int index1 = binarySearch (array, 0, 8-1, 5);
if(index1 == -1)
cout<<endl<<"5 cannot be found!";
else
cout<<endl<<"5 can be found at index : "<< index1;
  
cout<<endl<<"Find 75";
int index2 = binarySearch (array, 0, 8-1, 75);
if(index2 == -1)
cout<<endl<<"75 cannot be found!";
else
cout<<endl<<"75 can be found at index : "<< index2;
cout<<"\n\nOutput for Task 5";
cout<<endl<<"Five largest elements are : ";
for(int i=7;i>=7-5;i--)
{
cout<<array[i]<<" ";
}
return 0;
}

Output:

Output for Task 2 Numbers greater than 40 are 85 55 69 75 Output for Task 3 My vector is : 25 39 12 85 55 69 40 75 My sorted vector is : 12 25 39 40 55 69 75 85 Output for Task 4 Find 5 5 cannot be found! Find 75 75 can be found at index : 6 Output for Task 5 Five largest elements are : 85 75 69 55 40 39 .Program finished with exit code 0 Press ENTER to exit console.

Hope this helps!!