Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
📂 Aspire Study Library
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 $\Omega(g(n))$.
(B) its worst-case running time is $\Omega(g(n))$ and its best-case running time is $O(g(n))$.
(C) $O(g(n))=\Omega(g(n))$.
(D) $o(g(n))\cap \omega(g(n))$ is non-empty.
Choose the correct answer from the options given below:
(A) its worst-case running time is $O(g(n))$ and its best-case running time is $\Omega(g(n))$.
(B) its worst-case running time is $\Omega(g(n))$ and its best-case running time is $O(g(n))$.
(C) $O(g(n))=\Omega(g(n))$.
(D) $o(g(n))\cap \omega(g(n))$ is non-empty.
Choose the correct answer from the options given below:
Aspire Study Online Test Series,
Information About Examination,
Syllabus, Notification
and More.
View More
📲
Ask Your Question or Put Your Review.
