Give a recursive algorithm which takes as input a sequence of numbers and returns the minimum (i.e., smallest) number in the seq
uence. Your algorithm should not use a loop.
1 answer:
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)
You might be interested in
53.67 to one decimal place is 53.7 since you round the .6 to the .7
Answer:
Explanation:
05/10
Simplifying
1/2
or 2^-1
Hope this helps you. Do mark me as brainlist
2/3 + 2/3 + 2/3 + 2/3
8/3
2 2/3
Answer:
well 2^6 = 64 so 8x8, 32x2 and 16x4 would all be correct
Answer:
10 (?)
Step-by-step explanation:
6 during lunch + 4 during dinner would be 10. Not sure why you said lunch twice.
