engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
Which of the following loop is most efficient to implement considering time complexity?
1
For (k = 0; k < n; k ++)
2
For (k = 1; k < n; k * = 5)
3
For (k = n; k > 0; k = sqrt (k))
4
All of the above