Give a recursive algorithm which takes as input a sequence of numbers and returns the minimum (i. e., smallest) number in the sequence. Your algorithm should not use a loop.

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)

d

step-by-step explanation:

hello and welcome!

so, when we see the words "proportional" along with a table, we need to know that we're looking numbers that divide by the same thing.

looking at this table, we simply have to do a trial and error, and divide to see which numbers have the same quotient. if you look at choice a & c, they both have equal quotients for three of the numbers, with one exception, so those can't be the answer. looking at b, there is no similarity, so that can't be it. then, we see d; if you divide all the numbers in the table, you'll see that they all divide by two, which is a proportional relationship, and our answer!

also, always remember that the x will always be the number that goes into y, and somewhere behind this table, is a formula. for this specific table, the formula would be:

since our x-value is being divided by two to get the y-value. and if they were to ask for more numbers in the series, this is the formula you would use to find them.

19

step-by-step explanation: