https://elliot-blog.com/tags/%E5%A4%8D%E6%9D%82%E5%BA%A6%E8%AE%A1%E7%AE%97/Recent content in 复杂度计算 on 技术笔记Hugozh-CNTue, 17 Feb 2026 15:06:11 +0800https://elliot-blog.com/posts/202602/algorithm-complexity/Fri, 13 Feb 2026 00:00:00 +0000https://elliot-blog.com/posts/202602/algorithm-complexity/<h1 id="算法复杂度的渐进符号定义与理解">算法复杂度的渐进符号定义与理解</h1> <h2 id="常数形式定义">常数形式定义</h2> <h3 id="big-o-上界">Big-O (上界)</h3> <p>$T(N) = O(f(N))$ if there are positive constants $c$ and $n_0$ such that $T(N) \leq c \cdot f(N)$ when $N \geq n_0$.</p> <h3 id="big-omega-下界">Big-Omega (下界)</h3> <p>$T(N) = \Omega(g(N))$ if there are positive constants $c$ and $n_0$ such that $T(N) \geq c \cdot g(N)$ when $N \geq n_0$.</p> <h3 id="big-theta-紧确界">Big-Theta (紧确界)</h3> <p>$T(N) = \Theta(h(N))$ if and only if $T(N) = O(h(N))$ and $T(N) = \Omega(h(N))$.</p>