Question

please explain

[5 pts] What is the outcome of compiling and executing the following code. Assume it is embedded in an otherwise correct and complete C++ program

  void printBackwards(int *arr, int len){
         if (len <=0) return;

         cout<

}

   int main(){
        int arr[4] = {1, 2, 3, 4};
        printBackwards(arr, 4);

}

[10 pts] Implement a function that returns the minimum value in an integer array ​‘arr’​ of length ‘len’​. You MUST use a RECURSIVE solution.
//Precondition: An integer array with length at least one //Postcondition: Returns the minimum value in the array

int minArrayRecursive(int *arr, int len);

Answer 1

A)



Explanation: This will print the array backward, it will help us print 4,3,2,1.  
This is done using Recursion, we print the array last element using arr[len-1], then everytime length is decremented until it reached 0

B)

Minimum element using Recursion

#include <iostream>

using namespace std;

int minArrayRecursive(int a[], int n)

{

static int max = 9999;

if(n>=0)

{

if(max > a[n])

max = a[n];

max = minArrayRecursive(a,n-1);

}

return max;

}

int main()

{

int arr[100] = {4,5,12,56,2};

int max = minArrayRecursive(arr,4);

cout<<"Minimum element of the array is: "<<max<<endl;

return 0;

}

Thanks, PLEASE COMMENT if there is any concern.