Time Complexity & Asymptotic Analysis
12:00
Question 1 of 12
The recurrence relation that arises in relation with the complexity of binary search is: [GATE CS 2007]
T(n) = 2T(n/2) + k
T(n) = T(n/2) + k
T(n) = T(n/2) + log n
T(n) = T(n-1) + k
Question 1 of 12
The recurrence relation that arises in relation with the complexity of binary search is: [GATE CS 2007]