xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 12:36:30 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

deploy

Browse source
This commit is contained in:
krahets 2024-04-01 05:25:55 +08:00
parent bea0686622
commit 269d9c3760
33 changed files with 202 additions and 246 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
chapter_appendix/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="16">第 16 章 &nbsp; 附录<a class="headerlink" href="#16" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_appendix.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="附录" class="cover-image" src="../assets/covers/chapter_appendix.jpg" /></a></p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_appendix/installation/">16.1 &nbsp; 编程环境安装</a></li>

8
chapter_array_and_linkedlist/linked_list/index.html
View file

@ -3890,8 +3890,8 @@
<a id="__codelineno-12-3" name="__codelineno-12-3" href="#__codelineno-12-3"></a><span class="w"> </span><span class="kp">attr_accessor</span><span class="w"> </span><span class="ss">:val</span><span class="w"> </span><span class="c1"># 节点值</span>
<a id="__codelineno-12-4" name="__codelineno-12-4" href="#__codelineno-12-4"></a><span class="w"> </span><span class="kp">attr_accessor</span><span class="w"> </span><span class="ss">:next</span><span class="w"> </span><span class="c1"># 指向下一节点的引用</span>
<a id="__codelineno-12-5" name="__codelineno-12-5" href="#__codelineno-12-5"></a>
<a id="__codelineno-12-6" name="__codelineno-12-6" href="#__codelineno-12-6"></a><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">initialize</span><span class="p">(</span><span class="n">val</span><span class="o">=</span><span class="kp">nil</span><span class="p">,</span><span class="w"> </span><span class="n">next_node</span><span class="o">=</span><span class="kp">nil</span><span class="p">)</span>
<a id="__codelineno-12-7" name="__codelineno-12-7" href="#__codelineno-12-7"></a><span class="w"> </span><span class="vi">@val</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">val</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="mi">0</span>
<a id="__codelineno-12-6" name="__codelineno-12-6" href="#__codelineno-12-6"></a><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">initialize</span><span class="p">(</span><span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span><span class="w"> </span><span class="n">next_node</span><span class="o">=</span><span class="kp">nil</span><span class="p">)</span>
<a id="__codelineno-12-7" name="__codelineno-12-7" href="#__codelineno-12-7"></a><span class="w"> </span><span class="vi">@val</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">val</span>
<a id="__codelineno-12-8" name="__codelineno-12-8" href="#__codelineno-12-8"></a><span class="w"> </span><span class="vi">@next</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">next_node</span>
<a id="__codelineno-12-9" name="__codelineno-12-9" href="#__codelineno-12-9"></a><span class="w"> </span><span class="k">end</span>
<a id="__codelineno-12-10" name="__codelineno-12-10" href="#__codelineno-12-10"></a><span class="k">end</span>
@ -5084,8 +5084,8 @@
<a id="__codelineno-96-4" name="__codelineno-96-4" href="#__codelineno-96-4"></a><span class="w"> </span><span class="kp">attr_accessor</span><span class="w"> </span><span class="ss">:next</span><span class="w"> </span><span class="c1"># 指向后继节点的引用</span>
<a id="__codelineno-96-5" name="__codelineno-96-5" href="#__codelineno-96-5"></a><span class="w"> </span><span class="kp">attr_accessor</span><span class="w"> </span><span class="ss">:prev</span><span class="w"> </span><span class="c1"># 指向前驱节点的引用</span>
<a id="__codelineno-96-6" name="__codelineno-96-6" href="#__codelineno-96-6"></a>
<a id="__codelineno-96-7" name="__codelineno-96-7" href="#__codelineno-96-7"></a><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">initialize</span><span class="p">(</span><span class="n">val</span><span class="o">=</span><span class="kp">nil</span><span class="p">,</span><span class="w"> </span><span class="n">next_node</span><span class="o">=</span><span class="kp">nil</span><span class="p">,</span><span class="w"> </span><span class="n">prev_node</span><span class="o">=</span><span class="kp">nil</span><span class="p">)</span>
<a id="__codelineno-96-8" name="__codelineno-96-8" href="#__codelineno-96-8"></a><span class="w"> </span><span class="vi">@val</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">val</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="mi">0</span>
<a id="__codelineno-96-7" name="__codelineno-96-7" href="#__codelineno-96-7"></a><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">initialize</span><span class="p">(</span><span class="n">val</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span><span class="w"> </span><span class="n">next_node</span><span class="o">=</span><span class="kp">nil</span><span class="p">,</span><span class="w"> </span><span class="n">prev_node</span><span class="o">=</span><span class="kp">nil</span><span class="p">)</span>
<a id="__codelineno-96-8" name="__codelineno-96-8" href="#__codelineno-96-8"></a><span class="w"> </span><span class="vi">@val</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">val</span>
<a id="__codelineno-96-9" name="__codelineno-96-9" href="#__codelineno-96-9"></a><span class="w"> </span><span class="vi">@next</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">next_node</span>
<a id="__codelineno-96-10" name="__codelineno-96-10" href="#__codelineno-96-10"></a><span class="w"> </span><span class="vi">@prev</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">prev_node</span>
<a id="__codelineno-96-11" name="__codelineno-96-11" href="#__codelineno-96-11"></a><span class="w"> </span><span class="k">end</span>

12
chapter_array_and_linkedlist/list/index.html
View file

@ -3948,9 +3948,9 @@
</div>
<div class="tabbed-block">
<div class="highlight"><span class="filename">list.rb</span><pre><span></span><code><a id="__codelineno-26-1" name="__codelineno-26-1" href="#__codelineno-26-1"></a><span class="c1"># 访问元素</span>
<a id="__codelineno-26-2" name="__codelineno-26-2" href="#__codelineno-26-2"></a><span class="n">num</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">nums</span><span class="o">[</span><span class="mi">1</span><span class="o">]</span>
<a id="__codelineno-26-2" name="__codelineno-26-2" href="#__codelineno-26-2"></a><span class="n">num</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">nums</span><span class="o">[</span><span class="mi">1</span><span class="o">]</span><span class="w"> </span><span class="c1"># 访问索引 1 处的元素</span>
<a id="__codelineno-26-3" name="__codelineno-26-3" href="#__codelineno-26-3"></a><span class="c1"># 更新元素</span>
<a id="__codelineno-26-4" name="__codelineno-26-4" href="#__codelineno-26-4"></a><span class="n">nums</span><span class="o">[</span><span class="mi">1</span><span class="o">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
<a id="__codelineno-26-4" name="__codelineno-26-4" href="#__codelineno-26-4"></a><span class="n">nums</span><span class="o">[</span><span class="mi">1</span><span class="o">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="c1"># 将索引 1 处的元素更新为 0</span>
</code></pre></div>
</div>
<div class="tabbed-block">
@ -4186,10 +4186,10 @@
<a id="__codelineno-40-9" name="__codelineno-40-9" href="#__codelineno-40-9"></a><span class="n">nums</span><span class="w"> </span><span class="o">&lt;&lt;</span><span class="w"> </span><span class="mi">4</span>
<a id="__codelineno-40-10" name="__codelineno-40-10" href="#__codelineno-40-10"></a>
<a id="__codelineno-40-11" name="__codelineno-40-11" href="#__codelineno-40-11"></a><span class="c1"># 在中间插入元素</span>
<a id="__codelineno-40-12" name="__codelineno-40-12" href="#__codelineno-40-12"></a><span class="n">nums</span><span class="o">.</span><span class="n">insert</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">6</span>
<a id="__codelineno-40-12" name="__codelineno-40-12" href="#__codelineno-40-12"></a><span class="n">nums</span><span class="o">.</span><span class="n">insert</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">6</span><span class="w"> </span><span class="c1"># 在索引 3 处插入数字 6</span>
<a id="__codelineno-40-13" name="__codelineno-40-13" href="#__codelineno-40-13"></a>
<a id="__codelineno-40-14" name="__codelineno-40-14" href="#__codelineno-40-14"></a><span class="c1"># 删除元素</span>
<a id="__codelineno-40-15" name="__codelineno-40-15" href="#__codelineno-40-15"></a><span class="n">nums</span><span class="o">.</span><span class="n">delete_at</span><span class="w"> </span><span class="mi">3</span>
<a id="__codelineno-40-15" name="__codelineno-40-15" href="#__codelineno-40-15"></a><span class="n">nums</span><span class="o">.</span><span class="n">delete_at</span><span class="w"> </span><span class="mi">3</span><span class="w"> </span><span class="c1"># 删除索引 3 处的元素</span>
</code></pre></div>
</div>
<div class="tabbed-block">
@ -4541,7 +4541,7 @@
</code></pre></div>
</div>
<div class="tabbed-block">
<div class="highlight"><span class="filename">list.js</span><pre><span></span><code><a id="__codelineno-76-1" name="__codelineno-76-1" href="#__codelineno-76-1"></a><span class="cm">/* 排序列表 */</span><span class="w"> </span>
<div class="highlight"><span class="filename">list.js</span><pre><span></span><code><a id="__codelineno-76-1" name="__codelineno-76-1" href="#__codelineno-76-1"></a><span class="cm">/* 排序列表 */</span>
<a id="__codelineno-76-2" name="__codelineno-76-2" href="#__codelineno-76-2"></a><span class="nx">nums</span><span class="p">.</span><span class="nx">sort</span><span class="p">((</span><span class="nx">a</span><span class="p">,</span><span class="w"> </span><span class="nx">b</span><span class="p">)</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="nx">a</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="nx">b</span><span class="p">);</span><span class="w"> </span><span class="c1">// 排序后，列表元素从小到大排列</span>
</code></pre></div>
</div>
@ -4571,7 +4571,7 @@
</div>
<div class="tabbed-block">
<div class="highlight"><span class="filename">list.rb</span><pre><span></span><code><a id="__codelineno-82-1" name="__codelineno-82-1" href="#__codelineno-82-1"></a><span class="c1"># 排序列表</span>
<a id="__codelineno-82-2" name="__codelineno-82-2" href="#__codelineno-82-2"></a><span class="n">nums</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">nums</span><span class="o">.</span><span class="n">sort</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="o">|</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="o">|</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">&lt;=&gt;</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="p">}</span>
<a id="__codelineno-82-2" name="__codelineno-82-2" href="#__codelineno-82-2"></a><span class="n">nums</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">nums</span><span class="o">.</span><span class="n">sort</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="o">|</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="o">|</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">&lt;=&gt;</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="p">}</span><span class="w"> </span><span class="c1"># 排序后，列表元素从小到大排列</span>
</code></pre></div>
</div>
<div class="tabbed-block">

2
chapter_backtracking/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="13">第 13 章 &nbsp; 回溯<a class="headerlink" href="#13" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_backtracking.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="回溯" class="cover-image" src="../assets/covers/chapter_backtracking.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>我们如同迷宫中的探索者，在前进的道路上可能会遇到困难。</p>

2
chapter_computational_complexity/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="2">第 2 章 &nbsp; 复杂度分析<a class="headerlink" href="#2" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_complexity_analysis.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="复杂度分析" class="cover-image" src="../assets/covers/chapter_complexity_analysis.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>复杂度分析犹如浩瀚的算法宇宙中的时空向导。</p>

20
chapter_computational_complexity/space_complexity/index.html
View file

@ -796,7 +796,7 @@
<li class="md-nav__item">
<a href="#1-o1" class="md-nav__link">
<span class="md-ellipsis">
常数阶
1. &nbsp; 常数阶
</span>
</a>
@ -805,7 +805,7 @@
<li class="md-nav__item">
<a href="#2-on" class="md-nav__link">
<span class="md-ellipsis">
线性阶
2. &nbsp; 线性阶
</span>
</a>
@ -814,7 +814,7 @@
<li class="md-nav__item">
<a href="#3-on2" class="md-nav__link">
<span class="md-ellipsis">
平方阶
3. &nbsp; 平方阶
</span>
</a>
@ -823,7 +823,7 @@
<li class="md-nav__item">
<a href="#4-o2n" class="md-nav__link">
<span class="md-ellipsis">
指数阶
4. &nbsp; 指数阶
</span>
</a>
@ -832,7 +832,7 @@
<li class="md-nav__item">
<a href="#5-olog-n" class="md-nav__link">
<span class="md-ellipsis">
对数阶
5. &nbsp; 对数阶
</span>
</a>
@ -3646,7 +3646,7 @@
<li class="md-nav__item">
<a href="#1-o1" class="md-nav__link">
<span class="md-ellipsis">
常数阶
1. &nbsp; 常数阶
</span>
</a>
@ -3655,7 +3655,7 @@
<li class="md-nav__item">
<a href="#2-on" class="md-nav__link">
<span class="md-ellipsis">
线性阶
2. &nbsp; 线性阶
</span>
</a>
@ -3664,7 +3664,7 @@
<li class="md-nav__item">
<a href="#3-on2" class="md-nav__link">
<span class="md-ellipsis">
平方阶
3. &nbsp; 平方阶
</span>
</a>
@ -3673,7 +3673,7 @@
<li class="md-nav__item">
<a href="#4-o2n" class="md-nav__link">
<span class="md-ellipsis">
指数阶
4. &nbsp; 指数阶
</span>
</a>
@ -3682,7 +3682,7 @@
<li class="md-nav__item">
<a href="#5-olog-n" class="md-nav__link">
<span class="md-ellipsis">
对数阶
5. &nbsp; 对数阶
</span>
</a>

28
chapter_computational_complexity/time_complexity/index.html
View file

@ -808,7 +808,7 @@
<li class="md-nav__item">
<a href="#1-o1" class="md-nav__link">
<span class="md-ellipsis">
常数阶
1. &nbsp; 常数阶
</span>
</a>
@ -817,7 +817,7 @@
<li class="md-nav__item">
<a href="#2-on" class="md-nav__link">
<span class="md-ellipsis">
线性阶
2. &nbsp; 线性阶
</span>
</a>
@ -826,7 +826,7 @@
<li class="md-nav__item">
<a href="#3-on2" class="md-nav__link">
<span class="md-ellipsis">
平方阶
3. &nbsp; 平方阶
</span>
</a>
@ -835,7 +835,7 @@
<li class="md-nav__item">
<a href="#4-o2n" class="md-nav__link">
<span class="md-ellipsis">
指数阶
4. &nbsp; 指数阶
</span>
</a>
@ -844,7 +844,7 @@
<li class="md-nav__item">
<a href="#5-olog-n" class="md-nav__link">
<span class="md-ellipsis">
对数阶
5. &nbsp; 对数阶
</span>
</a>
@ -853,7 +853,7 @@
<li class="md-nav__item">
<a href="#6-on-log-n" class="md-nav__link">
<span class="md-ellipsis">
线性对数阶
6. &nbsp; 线性对数阶
</span>
</a>
@ -862,7 +862,7 @@
<li class="md-nav__item">
<a href="#7-on" class="md-nav__link">
<span class="md-ellipsis">
阶乘阶
7. &nbsp; 阶乘阶
</span>
</a>
@ -3730,7 +3730,7 @@
<li class="md-nav__item">
<a href="#1-o1" class="md-nav__link">
<span class="md-ellipsis">
常数阶
1. &nbsp; 常数阶
</span>
</a>
@ -3739,7 +3739,7 @@
<li class="md-nav__item">
<a href="#2-on" class="md-nav__link">
<span class="md-ellipsis">
线性阶
2. &nbsp; 线性阶
</span>
</a>
@ -3748,7 +3748,7 @@
<li class="md-nav__item">
<a href="#3-on2" class="md-nav__link">
<span class="md-ellipsis">
平方阶
3. &nbsp; 平方阶
</span>
</a>
@ -3757,7 +3757,7 @@
<li class="md-nav__item">
<a href="#4-o2n" class="md-nav__link">
<span class="md-ellipsis">
指数阶
4. &nbsp; 指数阶
</span>
</a>
@ -3766,7 +3766,7 @@
<li class="md-nav__item">
<a href="#5-olog-n" class="md-nav__link">
<span class="md-ellipsis">
对数阶
5. &nbsp; 对数阶
</span>
</a>
@ -3775,7 +3775,7 @@
<li class="md-nav__item">
<a href="#6-on-log-n" class="md-nav__link">
<span class="md-ellipsis">
线性对数阶
6. &nbsp; 线性对数阶
</span>
</a>
@ -3784,7 +3784,7 @@
<li class="md-nav__item">
<a href="#7-on" class="md-nav__link">
<span class="md-ellipsis">
阶乘阶
7. &nbsp; 阶乘阶
</span>
</a>

2
chapter_data_structure/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="3">第 3 章 &nbsp; 数据结构<a class="headerlink" href="#3" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_data_structure.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="数据结构" class="cover-image" src="../assets/covers/chapter_data_structure.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>数据结构如同一副稳固而多样的框架。</p>

2
chapter_divide_and_conquer/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="12">第 12 章 &nbsp; 分治<a class="headerlink" href="#12" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_divide_and_conquer.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="分治" class="cover-image" src="../assets/covers/chapter_divide_and_conquer.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>难题被逐层拆解，每一次的拆解都使它变得更为简单。</p>

2
chapter_dynamic_programming/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="14">第 14 章 &nbsp; 动态规划<a class="headerlink" href="#14" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_dynamic_programming.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="动态规划" class="cover-image" src="../assets/covers/chapter_dynamic_programming.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>小溪汇入河流，江河汇入大海。</p>

2
chapter_graph/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="9">第 9 章 &nbsp; 图<a class="headerlink" href="#9" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_graph.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="图" class="cover-image" src="../assets/covers/chapter_graph.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>在生命旅途中，我们就像是一个个节点，被无数看不见的边相连。</p>

2
chapter_greedy/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="15">第 15 章 &nbsp; 贪心<a class="headerlink" href="#15" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_greedy.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="贪心" class="cover-image" src="../assets/covers/chapter_greedy.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>向日葵朝着太阳转动，时刻追求自身成长的最大可能。</p>

2
chapter_hashing/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="6">第 6 章 &nbsp; 哈希表<a class="headerlink" href="#6" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_hashing.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="哈希表" class="cover-image" src="../assets/covers/chapter_hashing.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>在计算机世界中，哈希表如同一位聪慧的图书管理员。</p>

2
chapter_heap/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="8">第 8 章 &nbsp; 堆<a class="headerlink" href="#8" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_heap.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="堆" class="cover-image" src="../assets/covers/chapter_heap.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>堆就像是山岳峰峦，层叠起伏、形态各异。</p>

2
chapter_introduction/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="1">第 1 章 &nbsp; 初识算法<a class="headerlink" href="#1" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_introduction.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="初识算法" class="cover-image" src="../assets/covers/chapter_introduction.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>一位少女翩翩起舞，与数据交织在一起，裙摆上飘扬着算法的旋律。</p>

2
chapter_preface/index.html
View file

@ -3532,9 +3532,7 @@
<!-- Page content -->
<h1 id="0">第 0 章 &nbsp; 前言<a class="headerlink" href="#0" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_preface.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="前言" class="cover-image" src="../assets/covers/chapter_preface.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>算法犹如美妙的交响乐，每一行代码都像韵律般流淌。</p>

2
chapter_searching/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="10">第 10 章 &nbsp; 搜索<a class="headerlink" href="#10" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_searching.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="搜索" class="cover-image" src="../assets/covers/chapter_searching.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>搜索是一场未知的冒险，我们或许需要走遍神秘空间的每个角落，又或许可以快速锁定目标。</p>

2
chapter_sorting/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="11">第 11 章 &nbsp; 排序<a class="headerlink" href="#11" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_sorting.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="排序" class="cover-image" src="../assets/covers/chapter_sorting.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>排序犹如一把将混乱变为秩序的魔法钥匙，使我们能以更高效的方式理解与处理数据。</p>

2
chapter_stack_and_queue/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="5">第 5 章 &nbsp; 栈与队列<a class="headerlink" href="#5" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_stack_and_queue.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="栈与队列" class="cover-image" src="../assets/covers/chapter_stack_and_queue.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>栈如同叠猫猫，而队列就像猫猫排队。</p>

2
chapter_tree/index.html
View file

@ -3534,9 +3534,7 @@
<!-- Page content -->
<h1 id="7">第 7 章 &nbsp; 树<a class="headerlink" href="#7" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_tree.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="树" class="cover-image" src="../assets/covers/chapter_tree.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>参天大树充满生命力，根深叶茂，分枝扶疏。</p>

2
en/chapter_computational_complexity/index.html
View file

@ -1496,9 +1496,7 @@
<!-- Page content -->
<h1 id="chapter-2-complexity-analysis">Chapter 2. &nbsp; Complexity Analysis<a class="headerlink" href="#chapter-2-complexity-analysis" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_complexity_analysis.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="complexity_analysis" class="cover-image" src="../assets/covers/chapter_complexity_analysis.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>Complexity analysis is like a space-time navigator in the vast universe of algorithms.</p>

20
en/chapter_computational_complexity/space_complexity/index.html
View file

@ -796,7 +796,7 @@
<li class="md-nav__item">
<a href="#1-constant-order-o1" class="md-nav__link">
<span class="md-ellipsis">
Constant Order
1. &nbsp; Constant Order
</span>
</a>
@ -805,7 +805,7 @@
<li class="md-nav__item">
<a href="#2-linear-order-on" class="md-nav__link">
<span class="md-ellipsis">
Linear Order
2. &nbsp; Linear Order
</span>
</a>
@ -814,7 +814,7 @@
<li class="md-nav__item">
<a href="#3-quadratic-order-on2" class="md-nav__link">
<span class="md-ellipsis">
Quadratic Order
3. &nbsp; Quadratic Order
</span>
</a>
@ -823,7 +823,7 @@
<li class="md-nav__item">
<a href="#4-exponential-order-o2n" class="md-nav__link">
<span class="md-ellipsis">
Exponential Order
4. &nbsp; Exponential Order
</span>
</a>
@ -832,7 +832,7 @@
<li class="md-nav__item">
<a href="#5-logarithmic-order-olog-n" class="md-nav__link">
<span class="md-ellipsis">
Logarithmic Order
5. &nbsp; Logarithmic Order
</span>
</a>
@ -1608,7 +1608,7 @@
<li class="md-nav__item">
<a href="#1-constant-order-o1" class="md-nav__link">
<span class="md-ellipsis">
Constant Order
1. &nbsp; Constant Order
</span>
</a>
@ -1617,7 +1617,7 @@
<li class="md-nav__item">
<a href="#2-linear-order-on" class="md-nav__link">
<span class="md-ellipsis">
Linear Order
2. &nbsp; Linear Order
</span>
</a>
@ -1626,7 +1626,7 @@
<li class="md-nav__item">
<a href="#3-quadratic-order-on2" class="md-nav__link">
<span class="md-ellipsis">
Quadratic Order
3. &nbsp; Quadratic Order
</span>
</a>
@ -1635,7 +1635,7 @@
<li class="md-nav__item">
<a href="#4-exponential-order-o2n" class="md-nav__link">
<span class="md-ellipsis">
Exponential Order
4. &nbsp; Exponential Order
</span>
</a>
@ -1644,7 +1644,7 @@
<li class="md-nav__item">
<a href="#5-logarithmic-order-olog-n" class="md-nav__link">
<span class="md-ellipsis">
Logarithmic Order
5. &nbsp; Logarithmic Order
</span>
</a>

28
en/chapter_computational_complexity/time_complexity/index.html
View file

@ -808,7 +808,7 @@
<li class="md-nav__item">
<a href="#1-constant-order-o1" class="md-nav__link">
<span class="md-ellipsis">
Constant Order
1. &nbsp; Constant Order
</span>
</a>
@ -817,7 +817,7 @@
<li class="md-nav__item">
<a href="#2-linear-order-on" class="md-nav__link">
<span class="md-ellipsis">
Linear Order
2. &nbsp; Linear Order
</span>
</a>
@ -826,7 +826,7 @@
<li class="md-nav__item">
<a href="#3-quadratic-order-on2" class="md-nav__link">
<span class="md-ellipsis">
Quadratic Order
3. &nbsp; Quadratic Order
</span>
</a>
@ -835,7 +835,7 @@
<li class="md-nav__item">
<a href="#4-exponential-order-o2n" class="md-nav__link">
<span class="md-ellipsis">
Exponential Order
4. &nbsp; Exponential Order
</span>
</a>
@ -844,7 +844,7 @@
<li class="md-nav__item">
<a href="#5-logarithmic-order-olog-n" class="md-nav__link">
<span class="md-ellipsis">
Logarithmic Order
5. &nbsp; Logarithmic Order
</span>
</a>
@ -853,7 +853,7 @@
<li class="md-nav__item">
<a href="#6-linear-logarithmic-order-on-log-n" class="md-nav__link">
<span class="md-ellipsis">
Linear-Logarithmic Order
6. &nbsp; Linear-Logarithmic Order
</span>
</a>
@ -862,7 +862,7 @@
<li class="md-nav__item">
<a href="#7-factorial-order-on" class="md-nav__link">
<span class="md-ellipsis">
Factorial Order
7. &nbsp; Factorial Order
</span>
</a>
@ -1692,7 +1692,7 @@
<li class="md-nav__item">
<a href="#1-constant-order-o1" class="md-nav__link">
<span class="md-ellipsis">
Constant Order
1. &nbsp; Constant Order
</span>
</a>
@ -1701,7 +1701,7 @@
<li class="md-nav__item">
<a href="#2-linear-order-on" class="md-nav__link">
<span class="md-ellipsis">
Linear Order
2. &nbsp; Linear Order
</span>
</a>
@ -1710,7 +1710,7 @@
<li class="md-nav__item">
<a href="#3-quadratic-order-on2" class="md-nav__link">
<span class="md-ellipsis">
Quadratic Order
3. &nbsp; Quadratic Order
</span>
</a>
@ -1719,7 +1719,7 @@
<li class="md-nav__item">
<a href="#4-exponential-order-o2n" class="md-nav__link">
<span class="md-ellipsis">
Exponential Order
4. &nbsp; Exponential Order
</span>
</a>
@ -1728,7 +1728,7 @@
<li class="md-nav__item">
<a href="#5-logarithmic-order-olog-n" class="md-nav__link">
<span class="md-ellipsis">
Logarithmic Order
5. &nbsp; Logarithmic Order
</span>
</a>
@ -1737,7 +1737,7 @@
<li class="md-nav__item">
<a href="#6-linear-logarithmic-order-on-log-n" class="md-nav__link">
<span class="md-ellipsis">
Linear-Logarithmic Order
6. &nbsp; Linear-Logarithmic Order
</span>
</a>
@ -1746,7 +1746,7 @@
<li class="md-nav__item">
<a href="#7-factorial-order-on" class="md-nav__link">
<span class="md-ellipsis">
Factorial Order
7. &nbsp; Factorial Order
</span>
</a>

2
en/chapter_data_structure/index.html
View file

@ -1496,9 +1496,7 @@
<!-- Page content -->
<h1 id="chapter-3-data-structures">Chapter 3. &nbsp; Data Structures<a class="headerlink" href="#chapter-3-data-structures" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_data_structure.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="Data Structures" class="cover-image" src="../assets/covers/chapter_data_structure.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>Data structures serve as a robust and diverse framework.</p>

2
en/chapter_hashing/index.html
View file

@ -1496,9 +1496,7 @@
<!-- Page content -->
<h1 id="chapter-6-hash-table">Chapter 6. &nbsp; Hash Table<a class="headerlink" href="#chapter-6-hash-table" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_hashing.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="Hash Table" class="cover-image" src="../assets/covers/chapter_hashing.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>In the world of computing, a hash table is akin to an intelligent librarian.</p>

2
en/chapter_introduction/index.html
View file

@ -1496,9 +1496,7 @@
<!-- Page content -->
<h1 id="chapter-1-introduction-to-algorithms">Chapter 1. &nbsp; Introduction to Algorithms<a class="headerlink" href="#chapter-1-introduction-to-algorithms" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_introduction.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="A first look at the algorithm" class="cover-image" src="../assets/covers/chapter_introduction.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>A graceful maiden dances, intertwined with the data, her skirt swaying to the melody of algorithms.</p>

2
en/chapter_preface/index.html
View file

@ -1494,9 +1494,7 @@
<!-- Page content -->
<h1 id="chapter-0-preface">Chapter 0. &nbsp; Preface<a class="headerlink" href="#chapter-0-preface" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_preface.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="Preface" class="cover-image" src="../assets/covers/chapter_preface.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>Algorithms are like a beautiful symphony, with each line of code flowing like a rhythm.</p>

2
en/chapter_stack_and_queue/index.html
View file

@ -1496,9 +1496,7 @@
<!-- Page content -->
<h1 id="chapter-5-stack-and-queue">Chapter 5. &nbsp; Stack and Queue<a class="headerlink" href="#chapter-5-stack-and-queue" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_stack_and_queue.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="Stack and Queue" class="cover-image" src="../assets/covers/chapter_stack_and_queue.jpg" /></a></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>A stack is like cats placed on top of each other, while a queue is like cats lined up one by one.</p>

74
en/sitemap.xml
View file

@ -2,187 +2,187 @@
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://www.hello-algo.com/en/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/array/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/linked_list/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/list/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/ram_and_cache/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/iteration_and_recursion/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/performance_evaluation/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/space_complexity/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/time_complexity/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/basic_data_types/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/character_encoding/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/classification_of_data_structure/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/number_encoding/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_hashing/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_hashing/hash_algorithm/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_hashing/hash_collision/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_hashing/hash_map/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_hashing/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_introduction/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_introduction/algorithms_are_everywhere/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_introduction/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_introduction/what_is_dsa/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_preface/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_preface/about_the_book/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_preface/suggestions/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_preface/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/deque/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/queue/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/stack/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
</urlset>

BIN
en/sitemap.xml.gz
View file

Binary file not shown.

2
search/search_index.json
View file

File diff suppressed because one or more lines are too long

210
sitemap.xml
View file

@ -2,527 +2,527 @@
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://www.hello-algo.com/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/contribution/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/installation/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/terminology/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/array/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/linked_list/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/list/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/ram_and_cache/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/backtracking_algorithm/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/n_queens_problem/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/permutations_problem/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/subset_sum_problem/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/iteration_and_recursion/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/performance_evaluation/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/space_complexity/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/time_complexity/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/basic_data_types/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/character_encoding/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/classification_of_data_structure/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/number_encoding/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/binary_search_recur/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/build_binary_tree_problem/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/divide_and_conquer/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/hanota_problem/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/dp_problem_features/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/dp_solution_pipeline/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/edit_distance_problem/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/intro_to_dynamic_programming/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/knapsack_problem/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/unbounded_knapsack_problem/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/graph/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/graph_operations/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/graph_traversal/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/fractional_knapsack_problem/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/greedy_algorithm/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/max_capacity_problem/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/max_product_cutting_problem/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/hash_algorithm/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/hash_collision/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/hash_map/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/build_heap/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/heap/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/top_k/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/algorithms_are_everywhere/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/what_is_dsa/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_paperbook/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/about_the_book/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/suggestions/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_reference/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/binary_search/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/binary_search_edge/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/binary_search_insertion/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/replace_linear_by_hashing/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/searching_algorithm_revisited/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/bubble_sort/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/bucket_sort/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/counting_sort/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/heap_sort/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/insertion_sort/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/merge_sort/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/quick_sort/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/radix_sort/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/selection_sort/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/sorting_algorithm/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/deque/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/queue/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/stack/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/array_representation_of_tree/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/avl_tree/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/binary_search_tree/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/binary_tree/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/binary_tree_traversal/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/summary/</loc>
<lastmod>2024-03-30</lastmod>
<lastmod>2024-03-31</lastmod>
<changefreq>daily</changefreq>
</url>
</urlset>

BIN
sitemap.xml.gz
View file

Binary file not shown.