Consider the following recursive algorithm Ci j x that check

Consider the following recursive algorithm C(i, j, x) that checks whether the array segment A[i..j] contains key x, where i lessthanorequalto j. It return YES if x is found and NO otherwise (note that floor(x) is the floor function that returns the largest integer that is less than or equal to x): C(i, j, x) if i=j then if A[i] = x return YES else return NO else if C(i, floor((i + j)/2), x) = YES return YES else return C(floor((i + j)/2) + 1, j, x) Let t(n) be the worst case time for C(1, n, x) and assume that n Is a power of 2. (a) Give a recurrence for t(n). Don\'t forget the initial condition; and (b) solve t(n) using the following methods: iteration, recursion tree, and the masters method. No credit will be given if your recurrence is incorrect.

Solution

/Input: A positive whole number n

/Output: The total of the primary n 3D shapes

in the event that n = 1 return 1

else return S(n 1) + n n n

a. Set up and comprehend a repeat connection for the quantity of times the

calculation\'s fundamental operation is executed.

b. How does this calculation contrast and the clear nonrecursive

calculation for figuring this capacity?

4. Consider the accompanying recursive calculation.

Calculation Q(n)

/Input: A positive number n

in the event that n = 1 return 1

else return Q(n 1) + 2 n 1

a. Set up a repeat connection for this current capacity\'s qualities and settle it

to figure out what this calculation registers.

b. Set up a repeat connection for the quantity of augmentations made by

this calculation and fathom it.

c. Set up a repeat connection for the quantity of augmentations/subtractions

made by this calculation and fathom it.