https://elliot-blog.com/categories/data-struct/Recent content in Data-Struct on 技术笔记Hugozh-CNTue, 17 Feb 2026 15:06:11 +0800https://elliot-blog.com/posts/202602/data-struct-array/Tue, 17 Feb 2026 00:00:00 +0000https://elliot-blog.com/posts/202602/data-struct-array/<h1 id="数据结构-多维数组的超平面视角从索引到地址的映射">数据结构-多维数组的超平面视角：从索引到地址的映射</h1> <h2 id="核心思想">核心思想</h2> <p>多维数组在逻辑上是嵌套的子空间结构，在物理上是一段连续的内存。</p> <p><strong>寻址的本质：每一维的索引跳过若干个完整的子空间；未满的那个子空间，进入下一维继续定位，直到 0 维。</strong></p>https://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>