Asymptotic notation - Computer Networking

Asymptotic notation – Computer Networking

Question 1 UGC NET June-2020
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)

Show Answer With Best Explanation

Answer : A
Explanation:
Worst case: bigOh (O) is used to represent worst case running time or upper bound.
Average case : bigThega(Θ) is used to represent average case running time or average bound.
Best case : bigOmega(Ω) is used to represent best case running time or lower bound.
Diagram of all these three.