Question

DO NOT use for loop and while loop

Goal:

Learn how to use recursive functions.

General requirement:

Use cout to fully demonstrate your works for all tasks. The output must clearly show how each of these functions work. If no output is displayed for a task below, 0 point will be given to the task. If the output is not clear, some points may be deducted.   

Task 1 – Reverse array (3 pts)

Given an integer array like:

const int SIZE =9;

int arrInt[SIZE]={11,22,33,44,55,66,77,88,99};

Use a recursive function to reverse the values in the array. That is, after calling the function the array should be like:

     arrInt[SIZE]={99,88,77,66,55,44,33,22,11};

Task 2 – Array sum: Linear recursive version (3 pts)

   Use a linear recursive function to add the integers of the array in Task 1 and display the sum.

Task 3 – Array sum: Binary recursive version (4 pts)

   Use a binary recursive function to add the integers of the array in Task 1 and display the sum.

Task 4 – Linear search: Recursive version (5 pts)

   Use a linear recursive function to search an integer in an array and display the index of the target.

Task 5 – Binary search: Recursive version (5 pts)

   Use a binary recursive function to search an integer in an array and display the index of the target.

#include <iostream> using namespace std; int linearSearch(int [], int, int, int); int binarySearch(int [], int, int, int); int main() {     const int SIZE =9;     int arrInt[SIZE]={11,22,33,44,55,66,77,88,99};     /// Enter your testing code for Task 1, 2 and 3 here     cout << endl << "Task 4" << endl;     int target = 99;     int pos = linearSearch(arrInt, 0, SIZE, target);     cout << "Linear search: The position of the target " << target << " is " << pos << endl;     target = 66;     pos = linearSearch(arrInt, 0, SIZE, target);     cout << "Linear search: The position of the target " << target << " is " << pos << endl;     cout << endl << "Task 5" << endl;     target = 99;     pos = binarySearch(arrInt, 0, SIZE - 1, target);     cout << "Binary search: The position of the target " << target << " is " << pos << endl;     target = 66;     pos = binarySearch(arrInt, 0, SIZE - 1, target);     cout << "Binary search: The position of the target " << target << " is " << pos << endl;     return 0; } int linearSearch(int arrInt[], int pos, int sz, int target) { /// TO DO: ADD YOUR CODE HERE } int binarySearch(int arrInt[], int begIndex, int endIndex, int target) {     /// TO DO: ADD YOUR CODE HERE }

Answer 1

C++ code

============================================================================================

#include <iostream>

using namespace std;

int linearSearch(int [], int, int, int);

int binarySearch(int [], int, int, int);

void reverseArray(int [],int,int);

int linearSum(int [],int);

int binarySum(int[],int,int);

void display(int arr[],int n)
{
   int i;
   for(i=0;i<n;i++)
   cout<<arr[i]<<" ";
   cout<<"\n";
}

int main()

{

const int SIZE =9;

int arrInt[SIZE]={11,22,33,44,55,66,77,88,99};

/// Enter your testing code for Task 1, 2 and 3 here
  
//Task 1
cout << endl << "Task 1" << endl;
cout<<"Array before Reverse: ";
display(arrInt,SIZE);
reverseArray(arrInt,0,SIZE-1);
cout<<"Array After Reverse: ";
display(arrInt,SIZE);

  
//Task2
cout << endl << "Task 2" << endl;
cout<<"Array Sum using Linear Recusrion: "<<linearSum(arrInt,SIZE);
cout<<endl;
  
//Task3
cout << endl << "Task 3" << endl;
cout<<"Array Sum using Binary Recusrion: "<<binarySum(arrInt,0,SIZE-1);
cout<<endl;

cout << endl << "Task 4" << endl;
reverseArray(arrInt,0,SIZE-1);
int target = 99;

int pos = linearSearch(arrInt, 0, SIZE, target);

cout << "Linear search: The position of the target " << target << " is " << pos << endl;

target = 66;

pos = linearSearch(arrInt, 0, SIZE, target);

cout << "Linear search: The position of the target " << target << " is " << pos << endl;

cout << endl << "Task 5" << endl;

target = 99;

pos = binarySearch(arrInt, 0, SIZE - 1, target);

cout << "Binary search: The position of the target " << target << " is " << pos << endl;

target = 66;

pos = binarySearch(arrInt, 0, SIZE - 1, target);

cout << "Binary search: The position of the target " << target << " is " << pos << endl;

return 0;

}

void reverseArray(int arrInt[], int begIndex, int endIndex)
{
   if(begIndex>=endIndex)
       return;
   int temp=arrInt[begIndex];
   arrInt[begIndex]=arrInt[endIndex];
   arrInt[endIndex]=temp;
  
   reverseArray(arrInt,begIndex+1,endIndex-1);
  
}

int linearSum(int arrInt[],int n)
{
   if(n==1)
   {
       return arrInt[0];
   }
   else if(n>0)
   {
       return linearSum(arrInt,n-1)+arrInt[n-1];
   }
   else
   {
       return -1;
   }
}

int binarySum(int arrInt[], int begIndex, int endIndex)
{
  
   if(begIndex>endIndex)
   return 0;
   else if(begIndex==endIndex)
   return arrInt[begIndex];
   else
   {
       int mid=(begIndex+endIndex)/2;
       return binarySum(arrInt,begIndex,mid)+binarySum(arrInt,mid+1,endIndex);
   }
}

int linearSearch(int arrInt[], int pos, int sz, int target)

{
       if(sz<0) { // Base case - not found
return -1;
}
if(arrInt[sz]==target) { // Base case - found
return sz;
}
// Recursive case
return linearSearch(arrInt,0, sz-1, target);

}

int binarySearch(int arrInt[], int begIndex, int endIndex, int target)

{
   if(begIndex>endIndex)
   return -1;
   int mid=(begIndex+endIndex)/2;
   if(arrInt[mid]==target)
       {
           return mid;
       }
   else if(arrInt[mid]>target)
   {
           return binarySearch(arrInt,begIndex,mid-1,target);
   }
   else
   {
           return binarySearch(arrInt,mid+1,endIndex,target);
   }
  

}

============================================================================================

Output