What Is Big-Omega notation ?
Big-Omega notation :-
It deals with the minimum time (best case) required by an algorithm ,f(n) is said to be Omega (g(n)) if there exists positive constant and no such that if (n)>=c * g(n) for all n>=n0,c>0.
Omega gives the lower bound of time required by the algorithm.
Subscribe to:
Post Comments
(
Atom
)
No comments :
Post a Comment