BANK SEBI Grade A Phase 1 & Phase 2 Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
Arrange the following complexity of the algorithm in ascending order.
O(2n), O(n), O(log2 n), O(n log2 n), O(n2)1
O(n), O(n log2 n), O(n2), O(2n), O(log2 n)
2
O(log2 n), O(n log2 n), O(n), O(n2), O(2n)
3
O(n), O(n2), O(log2 n), O(n log2 n), O(2n)
4
O(n), O(log2 n), O(n log2 n), O(n2), O(2n)
5
O(log2 n), O(n), O(n log2 n), O(n2), O(2n)