C Programming 1.Enter an integer into n 2.Use malloc to dynamically allocate an array of size n, the array name is data 3.Enter n integers of any value 4.Complete a function, int FindMax (the parameter is defined by yourself), use therecursion to find the largest value in the array, and return the position of thelargest value in the array 5.Call FindMax() to find the maximum value Input: first line: integer n second line: n integers of any value output: Call FindMax()：The maximum value is data[?] = ???? Call RecursiveFindMax()：The maximum value is data[?] = ???? E.g 5 2 1 7 8 3 Call FindMax()：The maximum value is data[2] = 7 Call RecursiveFindMax()：The maximum value is data[2] = 7
C Programming
1.Enter an integer into n
2.Use malloc to dynamically allocate an array of size n, the array name is data
3.Enter n integers of any value
4.Complete a function, int FindMax (the parameter is defined by yourself), use therecursion to find the largest value in the array, and return the position of thelargest value in the array
5.Call FindMax() to find the maximum value
Input:
first line: integer n
second line: n integers of any value
output:
Call FindMax()：The maximum value is data[?] = ????
Call RecursiveFindMax()：The maximum value is data[?] = ????
E.g
5
2 1 7 8 3
Call FindMax()：The maximum value is data[2] = 7
Call RecursiveFindMax()：The maximum value is data[2] = 7
Step by step
Solved in 2 steps with 2 images
i think my example is mistake
the example correct answer should be data[3] = 8
i am sorry, can you fix the
thank you
by Bartleby ExpertExcuse me, about the line 10 and line 37
i want the data[2] is variable
like data[%d]
thank you!
by Bartleby Expert
