| | |
Summary: Introduction to
Bioinformatics
Algorithms
Lecture 3
Dr. Max Alekseyev
USC, 2009
Time Complexity
· TC is a function of the input lengthlength L. E.g.:
· if input is an integer M, then L is proportional to
log(M), i.e., L = (log M)
· if input is an array of size m with elements E,
then L = (m·log E)
· TC(L) is the number of operations (steps) performed
by an algorithm in the worst-caseworst-case.
· We are notnot interested in exact value of TC(L) but
rather in its asymptotic behavior (as L grows).
· Polynomial TC is "good"; exponential TC is "bad".
Examples
O(1) Constant
O(log(n)) Logarithmic
|
