1.

The recurrence relation that arises in relation with the complexity of binary search is

A. T(n) = 2T(n/ 2) + k , where k is constant
B. T(n) = T(n / 2) + k , where k is constant
C. T(n) = T(n / 2) + log n
D. T(n) = T(n / 2) + n
Answer» C. T(n) = T(n / 2) + log n


Discussion

No Comment Found