The maximum-valued element of an integer -valued array can be recursively calcul
ID: 3769215 • Letter: T
Question
The maximum-valued element of an integer -valued array can be recursively calculated as follows:
If the array has a single element , that is its maximum (note that a zero-sized array has no maximum)
Otherwise, compare the first element with the maximum of the rest of the array -- whichever is larger is the maximum value .
Write an int function named max that accepts an integer array , and the number of elements in the array and returns the largest value in the array . Assume the array has at least one element .
Explanation / Answer
#include<iostream>
using namespace std;
int max(int *arr,int n)
{
if(n==0)
return -1;
else if(n==1)
return arr[0];
else
{
int temp = max(arr,n-1);
if(arr[n]>temp)
return arr[n];
else
return temp;
}
}
int main()
{
int arr[] = {1,2,3,4,10,1,2};
cout << max(arr,7);
return 0;
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.