The recurrence relation that arises in relation with the complexity of binary…
PYQ GATE 1994
The recurrence relation that arises in relation with the complexity of binary search is:
- A.
T(n) = T(n/2) + k, k a constant
- B.
T(n) = 2T(n/2) + k, k a constant
- C.
T(n) = T(n/2) + log n
- D.
T(n) = T(n/2) + n
Attempted by 151 students.
Sign up free to check your answer
Sign up freeLoading lesson…