engineering recuitment UKPSC Polytechnic Lecturer Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
Which of the following is/are true about little oh(o) asymptotic notation?
I. f(x) = o(g(x)) iff f(x) = O(g(x))
II. f(x) = o(g(x)) iff f(x) ¹ W (g(x))
1
Only II
2
Both I and II
3
Only I
4
Neither I nor II