Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Searching, Sorting and Hashing Searching
The recurrence relation for binary search algorithm is :
1
T(n) = 2T(n/2) O (1)
2
T(n) = 2T(n/2) O (n)
3
T(n) = T(n/2) O (1)
4
T(n) = T(n/2) O (n)