What Is Big-Theta notation ?
Big-Theta notation :-
It deals with the average time required by the algorithm f(n) is Theta(g(n)) if there exits positive constants c1,c2 and n0 such that -
C1 g(n)<=f(n)<=c2 g(n) for all n>=n0
Theta notation denote the asymptotic right bounce of time complexity required by the algorithm.
Subscribe to:
Post Comments
(
Atom
)
No comments :
Post a Comment