Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
The running time of an algorithm is O(g(n)) if and only if
(A) its worst-case running time is O(g(n)) and its best-case running time is Ω(g(n)).(O = big O)
(B) its worst-case running time is Ω(g(n)) and its best-case running time is O(g(n)).(O = big O)
(C) O(g(n)) = Ω(g(n))(O = big O)
(D) O(g(n)) ∩ ω(g(n)) is non-empty set. (o = small o)
Choose the correct answer from the options given below:
1
(A) only
2
(B) only
3
(C) only
4
(D) only