Scribd
Upload
18 views1 page

Analysis PDF

Generally, it’s OK to disregard lower-order terms when analyzing the worst-case complexity of algorithms for large input sizes. Different notations like Big-Oh and Big-Theta are used to describe how functions grow asymptotically as the input size n becomes very large. These notations define the upper and lower bounds for how fast a function can grow relative to another function.

Uploaded by

Andrew Lee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views1 page

Analysis PDF

Generally, it’s OK to disregard lower-order terms when analyzing the worst-case complexity of algorithms for large input sizes. Different notations like Big-Oh and Big-Theta are used to describe how functions grow asymptotically as the input size n becomes very large. These notations define the upper and lower bounds for how fast a function can grow relative to another function.

Uploaded by

Andrew Lee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Algorithmic Analysis

Generally, its OK to disregard lower-order terms when doing worstcase analysis on algorithmic complexity. For asymptotically large input
values, dropping these terms loses very little predictive power. The following
notations are ways to describe the asymptotic behavior of functions, or how
a function grows when input size n becomes very large. Big-Oh and BigTheta notation are most commonly used.
(g(n)) = {f (n) | (c1 , c2 , n0 ) R+ |
n n0 ,

(1)

c1 g(n) f (n) c2 g(n)}

O(g(n)) = {f (n) | (c, n0 ) R+ | n n0 ,


+

(g(n)) = {f (n) | (c, n0 ) R | n n0 ,




f (n)
o(g(n) = f (n) | lim
=0
n g(n)


f (n)
(g(n)) = f (n) | lim
=
n g(n)

f (n) c1 g(n)}

(2)

cg(n) f (n)}

(3)
(4)
(5)

You might also like