BANK SEBI Grade A Phase 1 & Phase 2 Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
An unordered list (array) contains n distinct elements. The number of comparisons to find an element in the list that is larger than the second minimum in the list is
1
Θ(n/log n)
2
Θ(n)
3
Θ(n log n)
4
Θ(1)
5
Θ(n2)