T(n)= 3T(n/2) + 2n2 i.) a) How many sub problems are in the above recurrence? b) What the size of each of the sub proble
Posted: Mon Jun 06, 2022 4:51 pm
T(n)= 3T(n/2) + 2n2
i.)
a) How many sub problems are in the above recurrence?
b) What the size of each of the sub problems identified
above?
c) What is the work/time needed for non-recursive part (divide
and combine) of the recurrence?
ii) Use the recursive tree technique to obtain the running time
(time complexity) of the above recurrence?
i.)
a) How many sub problems are in the above recurrence?
b) What the size of each of the sub problems identified
above?
c) What is the work/time needed for non-recursive part (divide
and combine) of the recurrence?
ii) Use the recursive tree technique to obtain the running time
(time complexity) of the above recurrence?