Question

1. Write a binary recursivealgorithm that finds the maximum into an array. And apply it to the following array:  8 |6 | 19 | 2 | 3 |2 |1

Show (1) the stack trace and (2) the recursive tree. You can draw them by hand on paper and attach them a picture your answers in the word document.

Answer 1

Algorithm:

n=sizeof(array)

function find_max(array, n):

if(n==1):

return array[0];

else

return max(array[n-1], find_max(array, n-1));

The time complexity for this algorithm will be O(n). If you have any doubts, or if you want me to code the output, let me know in the comments and i will add that as well. If you have any doubts let me know.

Thank you :)