学习进度之一:Stanford:Algorithms: Design and Analysis, Part 一: II. ASYMPTOTIC ANALYSIS (Week 1)
学习进度之一:Stanford:Algorithms: Design and Analysis, Part 1: II. ASYMPTOTIC ANALYSIS (Week 1)
2.1 The Gist
这部分太简单了,没学到什么新东西。big O
2.2 Big-Oh Notation
T(n) = O(f(n)) iff there exits some C,N_0, T(n)<=Cf(n), when n>N_0
2.3 基本例子
纠正了自己一个错误,n**k ~= O(n**(k-1)).
2.4 Omega & Theta
Omega(f(n))= T(n) iff C * f(n) <= T(n) for some C, and N_0,when n>N_0.
theta(f(n)) iff Omega(f(n)) = T(n) and O(f(n))
little oh o(f(n)) iff C * f(n) >=T(n),for all C when n >= N_o
2.5 另外例子
简单的根据定义证明