Asymptotic Notation:
Asymptotic notation are used to describe the asymptotic running time of an
algorithm that are defined in terms of functions whose domains are the set of
natural numbers N
= {0, 1, 2, …}.
Such notations are convenience for
describing the worst case running time function T(n), which is usually defined
only on an integer input size.
Asymptotic Notations are three types,
these are –
(i) Big-O Notation
(ii) Omega-Ω Notation
(iii) Theta-
Notation
No comments:
Post a Comment