2. The mathametical representation of time c
omplexity is called as Asymtotic Notation
s.
Big oh ( O)notation
Big omegap(Ω)notation
Big theta (θ) notation
3. Big oh (O) notation: It is a method repr
esenting upper bound of algorithm's running
time.
Definition:
Let f(n)& g(n) ---->two non negative function
s.
n0 & c -----> constants
n0 is some input n>n0 , c>0
5. 5
YOUR TITLE
Add your words here according to your need to draw the text box size
YOUR TITLE
Add your words here according to your need to draw the text box size
YOUR TITLE
Add your words here according to your need to draw the text box size
YOUR TITLE
Add your words here according to your need to draw the text box size
Add your title here