摘要：
1. exponential algorithm: fib1(n) = fib1 (n-1) + fib1(n-2). running time:O(1.6n)2. polynomial algorithm: which is alsolinear programming, running time O(n2)3. using matrix multiplication: assume m bitsmultiplication time is M(n). T(n) = T (n/2) + M(n).Note: the sum of geometric series is simply the 阅读全文
