engineering recuitment NIC NIELIT Scientist B 2023 Mock Test 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(log2 n), O(n), O(n log2 n), O(n2), O(2n)
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)