Skip to content

Lec02 Asymptotic Notation

Definition

Alt text

  1. 上界
  2. 下界
  3. 上下界重合
  4. 无限接近但恒不等于

Rules of Asymptotic Notation运算法则

Alt text

IF/ESLE的时间复杂度选择 Alt text

题目

  1. The Fibonacci number sequence {\(F_N\)} The time complexity of the function which calculates \(F_N\) recursively is Θ(N!). 错误
       考察 斐波那契数列
  2. \(n^{0.01} is O(logn).\)错误.O的含义