Chapter 3, Problem 11R

Explanation of Solution

Algorithm:

FIND-MAX(A,n)

1. 1. if(n==1) then
2. 2.      return(A[1])
3. 3. else
4. 4.      return MAX(A(n), FIND-MAX(A,n-1))
5. 5. end if

MAX(x,y)

1. 1. if x>y then
2. 2.      return x
3. 3. Else
4. 4.      Return y

Explanation:

FIND-MAX():

• The above function is used to find the biggest value among n elements. The input of the function is an array “A” with “n” elements.
• The output of the array is the maximum number in the array.
• In the algorithm,
  • Define a method “FIND-MAX()”...

Explanation of Solution

Running time and space usage:

• The running time is O(n) as every element is checked...