engineering recuitment Beltron Programmer Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
An unordered list contains n distinct elements. The number of comparisons to find an elements in the list that is larger than the second minimum in the list is
1
θ (n/log n)
2
θ (log n)
3
θ (n log n)
4
θ (1)