Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
The second smallest of n elements can be found with _______ comparisons in worst case.
1
n + ceil(lg n) -2
2
n-1
3
lg n
4
3n/1