Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Searching, Sorting and Hashing Searching
The recurrence relation that arises in relation with the Complexity of binary search is
1
T(n) = T(n/2) + k , k a constant
2
T(n) = 2. T(n/2) + k , k a constant
3
T(n) = T(n/2) + log n
4
T(n) = T(n/2) + n