Q1.7

MCQMarks unknown

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

(A)

$T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$

(B)

$T(n) = T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$

(C)

$T(n) = T\left(\frac{n}{2}\right)+\log n$

(D)

$T(n) = T\left(\frac{n}{2}\right)+n$

Loading…