engineering recuitment UKPSC Polytechnic Lecturer Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
If an algorithm's behavior is bounded by "o(f(n)) if g(n)", what notation does it become when the condition is removed?
1
o(f(n))
2
o(g(n))
3
o(f(n) + g(n))
4
o(f(n) * g(n))