02-05-2013, 03:41 PM
Asymptotic Notations
Asymptotic Notations.ppt (Size: 40 KB / Downloads: 64)
Algorithms perform f(n) basic operations to accomplish task
Identify that function
Identify size of problem (n)
Count number of operations in terms of n
Execution time
Time computer takes to execute f(n) operations is cf(n)
where c
depends on speed of computer and
varies from computer to computer
Development of Notation
Not concerned with small values of n
Concerned with VERY LARGE values of n
Asymptotic – refers to study of function f as n approaches infinity
Example: f(n) = n2+4n + 20
n2 is the dominant term and the term 4n + 20 becomes insignificant as n grows larger