Question

a) Give a recursive algorithm for finding the max of a finite set of integers, making use of the fact that the max of n integers is the larger of the last integer in the list and the max of the first n-1 integers in the list. Procedure power(x,n): If (n=0): return 1 Else: return power(x,n-1) * x b) Use induction to prove your algorithm is correct

Name: a give a recursive algorithm for finding the max of a finite set of integers making use of the fact that the max of n integers is the larger of the last integer in the list and the max of th 21234
Uploaded: 2023-02-11T17:28:16-08:00
Duration: 3 min 20 s
Channel: Sri K
Description: a give a recursive algorithm for finding the max of a finite set of integers making use of the fact that the max of n integers is the larger of the last integer in the list and the max of th 21234

          a) Give a recursive algorithm for finding the max of a finite set of integers, making use of the fact that the max of n integers is the larger of the last integer in the list and the max of the first n-1 integers in the list. 
    
    Procedure power(x,n):
    If (n=0):
    return 1
    Else:
    return power(x,n-1) * x
    
    b) Use induction to prove your algorithm is correct

Added by Francisca B.

Calculus: Early Transcendentals

James Stewart 8th Edition

Thanks for your feedback!

a) Give a recursive algorithm for finding the max of a finite set of integers, making use of the fact that the max of n integers is the larger of the last integer in the list and the max of the first n-1 integers in the list. Procedure power(x,n): If (n=0): return 1 Else: return power(x,n-1) * x b) Use induction to prove your algorithm is correct