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)

figure c

step-by-step explanation:

hope this .

"standard form:

3x2 + 14x − 10 = 0

solutions based on quadratic formula:

x1   = −14 − √ 142 − 4×3×(−10) /   2×3   = −14 − 2 × √ 79 /   6   ≈ −5.296

x2   = −14 + √ 142 − 4×3×(−10) /   2×3   = −14 + 2 × √ 79 /   6   ≈ 0.629