The maximum-valued element of an integer -valued array can be recursively calcul

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 method 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

program:

#include<stdio.h>

int main()

{

   int a[10], i, num, largest;

printf(" Enter no of elements :");

   scanf("%d", &num);

for (i = 0; i < num; i++)

      scanf("%d", &a[i]);

   largest = a[0];

for (i = 0; i < num; i++)

{

      if (a[i] > largest)

{

         largest = a[i];

      }

   }

printf(" Largest Element : %d", largest);

return (0);

}

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.