算法导论课

Asymptotic notations

  • O notion
    • f(n) $\in$ O(g(n)), $\exists n_0 > 0, c > 0, n >= n_0 \Rightarrow f(n) \leqslant cg(n)$
  • o notion
  • $\Theta$ notion
  • $\Omega$ notion
  • $\omega$ notion

Common functions

  • Floors and Ceilings
  • Fibonacci Number
    • $ Fi = F{i-1} + F_{i-2}$
    • $F_i = \frac{\frac{(1+\sqrt{5}}{2})^i - \frac{(1-\sqrt{5}}{2})^i}{\sqrt{5}}$
    • $F_i \in \Theta(2^n)$

Master Theorem


本博客所有文章除特别声明外,均采用 CC BY-SA 4.0 协议 ,转载请注明出处!