Give a recursive algorithm which takes as input a sequence of numbers and returns the minimum (i.e., smallest) number in the sequence. Your
Question
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Answers ( )
Answer:
Step-by-step explanation:
So let a[i] be the input array to the function find_minimum(): . We will use python to present this recursive algorithm
def find_minimum(a, n):
if n == 1:
return a[0]
return min(a[n], find_minimum(a, n – 1))
find_minimum(a, len(a) – 1)