Complexity
O(1) O(n) O(n
c
)c > 1 O(c
n
)c > 1
constant linear polynomial exponential
determine if find max maximum solving the TSP
number is in an array matching for with dynamic
even or odd bipartite graphs programming
run time of Simplex for LPs (avg. case) is polynomial: linear # of
iterations wrt constraints; each iteration approx. a quadratic #
number of evaluations.