Question-80

Question-80

Give a recursive  algorithm for finding the maximum of a finite set of integers , making use of the fact that the maximum of n integers is the larger of the last integer in the list and the maximum of the first n – 1 integers in the list.

 

Solution

procedure max (a₁ , a₂, ……..a_n : integers)

if n = 1 then return a

else

m = max (a₁ , a₂,…..)

a_n – 1

if m > a_n

then return m

else return a_n