Question: c. (15 pts) Write a C function: int maximum (int list[], int n); that recursively finds the largest integer between list[0] and list[n]. Assume at

c. (15 pts) Write a C function:

int maximum (int list[], int n);

that recursively finds the largest integer between list[0] and list[n]. Assume at least one element is in the list. Test it with a main program (you write this program) that takes as input an integer count followed by the values. If you are not comfortable using scanf() you may hardwire a list and its size into your program. Output the original values followed by the maximum. Do not use a loop in maximum(). Output the value in the main program, not in the function.

Sample Input:

5 50 30 90 20 80

Sample Output:

Original list: 50 30 90 20 80

Largest value: 90

make sure it is a c program please!

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!