(Choose 1 answer)
(See picture)
A. 3
B. 1
C. 2
D. None of the other choices is correct
E. 0
Consider the following divide-and-conquer algorithm to find the maximal element in a sequence.
procudure MXE(L = a1,if n =1 then MXE(L) = a1 else m:= [n/2]L1 = a1, ..., am L2 = am+1, ..., an MXE(L) = max(MXE(L₁), MXE(L2))endan)
begin
Let f(n) be the number of comparisons used in the algorithm.The recurrence relation of f(n) is as follows:f(n) = a. f(n/2) + b, with n even.
Determine b.
E 44
