deploy

2024-12-25 13:16:29 +08:00 · 2024-01-04 04:56:58 +08:00 · 2024-01-04 04:56:58 +08:00 · 6b736530b1
commit 6b736530b1
parent 474f4b618c
139 changed files with 260 additions and 164 deletions
--- a/404.html
+++ b/404.html
@ -3408,7 +3408,7 @@
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_appendix/contribution/index.html
+++ b/chapter_appendix/contribution/index.html
@ -3754,7 +3754,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_appendix/index.html
+++ b/chapter_appendix/index.html
@ -3644,7 +3644,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_appendix/installation/index.html
+++ b/chapter_appendix/installation/index.html
@ -3936,7 +3936,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_appendix/terminology/index.html
+++ b/chapter_appendix/terminology/index.html
@ -3987,7 +3987,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_array_and_linkedlist/array/index.html
+++ b/chapter_array_and_linkedlist/array/index.html
@ -4915,7 +4915,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_array_and_linkedlist/index.html
+++ b/chapter_array_and_linkedlist/index.html
@ -3649,7 +3649,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_array_and_linkedlist/linked_list/index.html
+++ b/chapter_array_and_linkedlist/linked_list/index.html
@ -5037,7 +5037,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_array_and_linkedlist/list/index.html
+++ b/chapter_array_and_linkedlist/list/index.html
@ -5779,7 +5779,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_array_and_linkedlist/ram_and_cache/index.html
+++ b/chapter_array_and_linkedlist/ram_and_cache/index.html
@ -3822,7 +3822,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_array_and_linkedlist/summary/index.html
+++ b/chapter_array_and_linkedlist/summary/index.html
@ -3777,7 +3777,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_backtracking/backtracking_algorithm/index.html
+++ b/chapter_backtracking/backtracking_algorithm/index.html
@ -5403,7 +5403,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_backtracking/index.html
+++ b/chapter_backtracking/index.html
@ -3651,7 +3651,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_backtracking/n_queens_problem/index.html
+++ b/chapter_backtracking/n_queens_problem/index.html
@ -4342,7 +4342,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_backtracking/permutations_problem/index.html
+++ b/chapter_backtracking/permutations_problem/index.html
@ -4714,7 +4714,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_backtracking/subset_sum_problem/index.html
+++ b/chapter_backtracking/subset_sum_problem/index.html
@ -5158,7 +5158,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_backtracking/summary/index.html
+++ b/chapter_backtracking/summary/index.html
@ -3724,7 +3724,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_computational_complexity/index.html
+++ b/chapter_computational_complexity/index.html
@ -3651,7 +3651,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_computational_complexity/iteration_and_recursion/index.html
+++ b/chapter_computational_complexity/iteration_and_recursion/index.html
@ -3817,6 +3817,10 @@
 </div>
 </div>
 </div>
+<details class="pythontutor">
+<summary>分步调试</summary>
+<p><iframe width="800" height="550" frameborder="0" src="https://pythontutor.com/iframe-embed.html#code=def%20for_loop%28n%3A%20int%29%20-%3E%20int%3A%0A%20%20%20%20%22%22%22for%20%E5%BE%AA%E7%8E%AF%22%22%22%0A%20%20%20%20res%20%3D%200%0A%20%20%20%20%23%20%E5%BE%AA%E7%8E%AF%E6%B1%82%E5%92%8C%201,%202,%20...,%20n-1,%20n%0A%20%20%20%20for%20i%20in%20range%281,%20n%20%2B%201%29%3A%0A%20%20%20%20%20%20%20%20res%20%2B%3D%20i%0A%20%20%20%20return%20res%0A%0A%22%22%22Driver%20Code%22%22%22%0Aif%20__name__%20%3D%3D%20%22__main__%22%3A%0A%20%20%20%20n%20%3D%205%0A%20%20%20%20res%20%3D%20for_loop%28n%29%0A%20%20%20%20print%28f%22%5Cnfor%20%E5%BE%AA%E7%8E%AF%E7%9A%84%E6%B1%82%E5%92%8C%E7%BB%93%E6%9E%9C%20res%20%3D%20%7Bres%7D%22%29&codeDivHeight=400&codeDivWidth=350&cumulative=false&curInstr=0&heapPrimitives=nevernest&origin=opt-frontend.js&py=311&rawInputLstJSON=%5B%5D&textReferences=false"> </iframe></p>
+</details>
 <p>图 2-1 是该求和函数的流程框图。</p>
 <p><a class="glightbox" href="../iteration_and_recursion.assets/iteration.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="求和函数的流程框图" class="animation-figure" src="../iteration_and_recursion.assets/iteration.png" /></a></p>
 <p align="center"> 图 2-1 &nbsp; 求和函数的流程框图 </p>
@ -3997,6 +4001,10 @@
 </div>
 </div>
 </div>
+<details class="pythontutor">
+<summary>分步调试</summary>
+<p><iframe width="800" height="550" frameborder="0" src="https://pythontutor.com/iframe-embed.html#code=def%20while_loop%28n%3A%20int%29%20-%3E%20int%3A%0A%20%20%20%20%22%22%22while%20%E5%BE%AA%E7%8E%AF%22%22%22%0A%20%20%20%20res%20%3D%200%0A%20%20%20%20i%20%3D%201%20%20%23%20%E5%88%9D%E5%A7%8B%E5%8C%96%E6%9D%A1%E4%BB%B6%E5%8F%98%E9%87%8F%0A%20%20%20%20%23%20%E5%BE%AA%E7%8E%AF%E6%B1%82%E5%92%8C%201,%202,%20...,%20n-1,%20n%0A%20%20%20%20while%20i%20%3C%3D%20n%3A%0A%20%20%20%20%20%20%20%20res%20%2B%3D%20i%0A%20%20%20%20%20%20%20%20i%20%2B%3D%201%20%20%23%20%E6%9B%B4%E6%96%B0%E6%9D%A1%E4%BB%B6%E5%8F%98%E9%87%8F%0A%20%20%20%20return%20res%0A%0A%22%22%22Driver%20Code%22%22%22%0Aif%20__name__%20%3D%3D%20%22__main__%22%3A%0A%20%20%20%20n%20%3D%205%0A%20%20%20%20res%20%3D%20while_loop%28n%29%0A%20%20%20%20print%28f%22%5Cnwhile%20%E5%BE%AA%E7%8E%AF%E7%9A%84%E6%B1%82%E5%92%8C%E7%BB%93%E6%9E%9C%20res%20%3D%20%7Bres%7D%22%29&codeDivHeight=400&codeDivWidth=350&cumulative=false&curInstr=0&heapPrimitives=nevernest&origin=opt-frontend.js&py=311&rawInputLstJSON=%5B%5D&textReferences=false"> </iframe></p>
+</details>
 <p><strong><code>while</code> 循环比 <code>for</code> 循环的自由度更高</strong>。在 <code>while</code> 循环中，我们可以自由地设计条件变量的初始化和更新步骤。</p>
 <p>例如在以下代码中，条件变量 <span class="arithmatex">\(i\)</span> 每轮进行两次更新，这种情况就不太方便用 <code>for</code> 循环实现：</p>
 <div class="tabbed-set tabbed-alternate" data-tabs="3:12"><input checked="checked" id="__tabbed_3_1" name="__tabbed_3" type="radio" /><input id="__tabbed_3_2" name="__tabbed_3" type="radio" /><input id="__tabbed_3_3" name="__tabbed_3" type="radio" /><input id="__tabbed_3_4" name="__tabbed_3" type="radio" /><input id="__tabbed_3_5" name="__tabbed_3" type="radio" /><input id="__tabbed_3_6" name="__tabbed_3" type="radio" /><input id="__tabbed_3_7" name="__tabbed_3" type="radio" /><input id="__tabbed_3_8" name="__tabbed_3" type="radio" /><input id="__tabbed_3_9" name="__tabbed_3" type="radio" /><input id="__tabbed_3_10" name="__tabbed_3" type="radio" /><input id="__tabbed_3_11" name="__tabbed_3" type="radio" /><input id="__tabbed_3_12" name="__tabbed_3" type="radio" /><div class="tabbed-labels"><label for="__tabbed_3_1">Python</label><label for="__tabbed_3_2">C++</label><label for="__tabbed_3_3">Java</label><label for="__tabbed_3_4">C#</label><label for="__tabbed_3_5">Go</label><label for="__tabbed_3_6">Swift</label><label for="__tabbed_3_7">JS</label><label for="__tabbed_3_8">TS</label><label for="__tabbed_3_9">Dart</label><label for="__tabbed_3_10">Rust</label><label for="__tabbed_3_11">C</label><label for="__tabbed_3_12">Zig</label></div>
@ -4194,6 +4202,10 @@
 </div>
 </div>
 </div>
+<details class="pythontutor">
+<summary>分步调试</summary>
+<p><iframe width="800" height="550" frameborder="0" src="https://pythontutor.com/iframe-embed.html#code=def%20while_loop_ii%28n%3A%20int%29%20-%3E%20int%3A%0A%20%20%20%20%22%22%22while%20%E5%BE%AA%E7%8E%AF%EF%BC%88%E4%B8%A4%E6%AC%A1%E6%9B%B4%E6%96%B0%EF%BC%89%22%22%22%0A%20%20%20%20res%20%3D%200%0A%20%20%20%20i%20%3D%201%20%20%23%20%E5%88%9D%E5%A7%8B%E5%8C%96%E6%9D%A1%E4%BB%B6%E5%8F%98%E9%87%8F%0A%20%20%20%20%23%20%E5%BE%AA%E7%8E%AF%E6%B1%82%E5%92%8C%201,%204,%2010,%20...%0A%20%20%20%20while%20i%20%3C%3D%20n%3A%0A%20%20%20%20%20%20%20%20res%20%2B%3D%20i%0A%20%20%20%20%20%20%20%20%23%20%E6%9B%B4%E6%96%B0%E6%9D%A1%E4%BB%B6%E5%8F%98%E9%87%8F%0A%20%20%20%20%20%20%20%20i%20%2B%3D%201%0A%20%20%20%20%20%20%20%20i%20*%3D%202%0A%20%20%20%20return%20res%0A%0A%22%22%22Driver%20Code%22%22%22%0Aif%20__name__%20%3D%3D%20%22__main__%22%3A%0A%20%20%20%20n%20%3D%205%0A%20%20%20%20res%20%3D%20while_loop_ii%28n%29%0A%20%20%20%20print%28f%22%5Cnwhile%20%E5%BE%AA%E7%8E%AF%EF%BC%88%E4%B8%A4%E6%AC%A1%E6%9B%B4%E6%96%B0%EF%BC%89%E6%B1%82%E5%92%8C%E7%BB%93%E6%9E%9C%20res%20%3D%20%7Bres%7D%22%29&codeDivHeight=400&codeDivWidth=350&cumulative=false&curInstr=0&heapPrimitives=nevernest&origin=opt-frontend.js&py=311&rawInputLstJSON=%5B%5D&textReferences=false"> </iframe></p>
+</details>
 <p>总的来说，<strong><code>for</code> 循环的代码更加紧凑，<code>while</code> 循环更加灵活</strong>，两者都可以实现迭代结构。选择使用哪一个应该根据特定问题的需求来决定。</p>
 <h3 id="3">3. &nbsp; 嵌套循环<a class="headerlink" href="#3" title="Permanent link">&para;</a></h3>
 <p>我们可以在一个循环结构内嵌套另一个循环结构，下面以 <code>for</code> 循环为例：</p>
@ -4385,6 +4397,10 @@
 </div>
 </div>
 </div>
+<details class="pythontutor">
+<summary>分步调试</summary>
+<p><iframe width="800" height="550" frameborder="0" src="https://pythontutor.com/iframe-embed.html#code=def%20nested_for_loop%28n%3A%20int%29%20-%3E%20str%3A%0A%20%20%20%20%22%22%22%E5%8F%8C%E5%B1%82%20for%20%E5%BE%AA%E7%8E%AF%22%22%22%0A%20%20%20%20res%20%3D%20%22%22%0A%20%20%20%20%23%20%E5%BE%AA%E7%8E%AF%20i%20%3D%201,%202,%20...,%20n-1,%20n%0A%20%20%20%20for%20i%20in%20range%281,%20n%20%2B%201%29%3A%0A%20%20%20%20%20%20%20%20%23%20%E5%BE%AA%E7%8E%AF%20j%20%3D%201,%202,%20...,%20n-1,%20n%0A%20%20%20%20%20%20%20%20for%20j%20in%20range%281,%20n%20%2B%201%29%3A%0A%20%20%20%20%20%20%20%20%20%20%20%20res%20%2B%3D%20f%22%28%7Bi%7D,%20%7Bj%7D%29,%20%22%0A%20%20%20%20return%20res%0A%0A%22%22%22Driver%20Code%22%22%22%0Aif%20__name__%20%3D%3D%20%22__main__%22%3A%0A%20%20%20%20n%20%3D%205%0A%20%20%20%20res%20%3D%20nested_for_loop%28n%29%0A%20%20%20%20print%28f%22%5Cn%E5%8F%8C%E5%B1%82%20for%20%E5%BE%AA%E7%8E%AF%E7%9A%84%E9%81%8D%E5%8E%86%E7%BB%93%E6%9E%9C%20%7Bres%7D%22%29&codeDivHeight=400&codeDivWidth=350&cumulative=false&curInstr=0&heapPrimitives=nevernest&origin=opt-frontend.js&py=311&rawInputLstJSON=%5B%5D&textReferences=false"> </iframe></p>
+</details>
 <p>图 2-2 是该嵌套循环的流程框图。</p>
 <p><a class="glightbox" href="../iteration_and_recursion.assets/nested_iteration.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="嵌套循环的流程框图" class="animation-figure" src="../iteration_and_recursion.assets/nested_iteration.png" /></a></p>
 <p align="center"> 图 2-2 &nbsp; 嵌套循环的流程框图 </p>
@ -4564,6 +4580,10 @@
 </div>
 </div>
 </div>
+<details class="pythontutor">
+<summary>分步调试</summary>
+<p><iframe width="800" height="550" frameborder="0" src="https://pythontutor.com/iframe-embed.html#code=def%20recur%28n%3A%20int%29%20-%3E%20int%3A%0A%20%20%20%20%22%22%22%E9%80%92%E5%BD%92%22%22%22%0A%20%20%20%20%23%20%E7%BB%88%E6%AD%A2%E6%9D%A1%E4%BB%B6%0A%20%20%20%20if%20n%20%3D%3D%201%3A%0A%20%20%20%20%20%20%20%20return%201%0A%20%20%20%20%23%20%E9%80%92%EF%BC%9A%E9%80%92%E5%BD%92%E8%B0%83%E7%94%A8%0A%20%20%20%20res%20%3D%20recur%28n%20-%201%29%0A%20%20%20%20%23%20%E5%BD%92%EF%BC%9A%E8%BF%94%E5%9B%9E%E7%BB%93%E6%9E%9C%0A%20%20%20%20return%20n%20%2B%20res%0A%0A%22%22%22Driver%20Code%22%22%22%0Aif%20__name__%20%3D%3D%20%22__main__%22%3A%0A%20%20%20%20n%20%3D%205%0A%20%20%20%20res%20%3D%20recur%28n%29%0A%20%20%20%20print%28f%22%5Cn%E9%80%92%E5%BD%92%E5%87%BD%E6%95%B0%E7%9A%84%E6%B1%82%E5%92%8C%E7%BB%93%E6%9E%9C%20res%20%3D%20%7Bres%7D%22%29&codeDivHeight=400&codeDivWidth=350&cumulative=false&curInstr=0&heapPrimitives=nevernest&origin=opt-frontend.js&py=311&rawInputLstJSON=%5B%5D&textReferences=false"> </iframe></p>
+</details>
 <p>图 2-3 展示了该函数的递归过程。</p>
 <p><a class="glightbox" href="../iteration_and_recursion.assets/recursion_sum.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="求和函数的递归过程" class="animation-figure" src="../iteration_and_recursion.assets/recursion_sum.png" /></a></p>
 <p align="center"> 图 2-3 &nbsp; 求和函数的递归过程 </p>
@ -4732,6 +4752,10 @@
 </div>
 </div>
 </div>
+<details class="pythontutor">
+<summary>分步调试</summary>
+<p><iframe width="800" height="550" frameborder="0" src="https://pythontutor.com/iframe-embed.html#code=def%20tail_recur%28n,%20res%29%3A%0A%20%20%20%20%22%22%22%E5%B0%BE%E9%80%92%E5%BD%92%22%22%22%0A%20%20%20%20%23%20%E7%BB%88%E6%AD%A2%E6%9D%A1%E4%BB%B6%0A%20%20%20%20if%20n%20%3D%3D%200%3A%0A%20%20%20%20%20%20%20%20return%20res%0A%20%20%20%20%23%20%E5%B0%BE%E9%80%92%E5%BD%92%E8%B0%83%E7%94%A8%0A%20%20%20%20return%20tail_recur%28n%20-%201,%20res%20%2B%20n%29%0A%0A%22%22%22Driver%20Code%22%22%22%0Aif%20__name__%20%3D%3D%20%22__main__%22%3A%0A%20%20%20%20n%20%3D%205%0A%20%20%20%20res%20%3D%20tail_recur%28n,%200%29%0A%20%20%20%20print%28f%22%5Cn%E5%B0%BE%E9%80%92%E5%BD%92%E5%87%BD%E6%95%B0%E7%9A%84%E6%B1%82%E5%92%8C%E7%BB%93%E6%9E%9C%20res%20%3D%20%7Bres%7D%22%29&codeDivHeight=400&codeDivWidth=350&cumulative=false&curInstr=0&heapPrimitives=nevernest&origin=opt-frontend.js&py=311&rawInputLstJSON=%5B%5D&textReferences=false"> </iframe></p>
+</details>
 <p>尾递归的执行过程如图 2-5 所示。对比普通递归和尾递归，两者的求和操作的执行点是不同的。</p>
 <ul>
 <li><strong>普通递归</strong>：求和操作是在“归”的过程中执行的，每层返回后都要再执行一次求和操作。</li>
@ -4916,6 +4940,10 @@
 </div>
 </div>
 </div>
+<details class="pythontutor">
+<summary>分步调试</summary>
+<p><iframe width="800" height="550" frameborder="0" src="https://pythontutor.com/iframe-embed.html#code=def%20fib%28n%3A%20int%29%20-%3E%20int%3A%0A%20%20%20%20%22%22%22%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97%EF%BC%9A%E9%80%92%E5%BD%92%22%22%22%0A%20%20%20%20%23%20%E7%BB%88%E6%AD%A2%E6%9D%A1%E4%BB%B6%20f%281%29%20%3D%200,%20f%282%29%20%3D%201%0A%20%20%20%20if%20n%20%3D%3D%201%20or%20n%20%3D%3D%202%3A%0A%20%20%20%20%20%20%20%20return%20n%20-%201%0A%20%20%20%20%23%20%E9%80%92%E5%BD%92%E8%B0%83%E7%94%A8%20f%28n%29%20%3D%20f%28n-1%29%20%2B%20f%28n-2%29%0A%20%20%20%20res%20%3D%20fib%28n%20-%201%29%20%2B%20fib%28n%20-%202%29%0A%20%20%20%20%23%20%E8%BF%94%E5%9B%9E%E7%BB%93%E6%9E%9C%20f%28n%29%0A%20%20%20%20return%20res%0A%0A%22%22%22Driver%20Code%22%22%22%0Aif%20__name__%20%3D%3D%20%22__main__%22%3A%0A%20%20%20%20n%20%3D%205%0A%20%20%20%20res%20%3D%20fib%28n%29%0A%20%20%20%20print%28f%22%5Cn%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97%E7%9A%84%E7%AC%AC%20%7Bn%7D%20%E9%A1%B9%E4%B8%BA%20%7Bres%7D%22%29&codeDivHeight=400&codeDivWidth=350&cumulative=false&curInstr=0&heapPrimitives=nevernest&origin=opt-frontend.js&py=311&rawInputLstJSON=%5B%5D&textReferences=false"> </iframe></p>
+</details>
 <p>观察以上代码，我们在函数内递归调用了两个函数，<strong>这意味着从一个调用产生了两个调用分支</strong>。如图 2-6 所示，这样不断递归调用下去，最终将产生一棵层数为 <span class="arithmatex">\(n\)</span> 的「递归树 recursion tree」。</p>
 <p><a class="glightbox" href="../iteration_and_recursion.assets/recursion_tree.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="斐波那契数列的递归树" class="animation-figure" src="../iteration_and_recursion.assets/recursion_tree.png" /></a></p>
 <p align="center"> 图 2-6 &nbsp; 斐波那契数列的递归树 </p>
@ -5230,6 +5258,10 @@
 </div>
 </div>
 </div>
+<details class="pythontutor">
+<summary>分步调试</summary>
+<p><iframe width="800" height="550" frameborder="0" src="https://pythontutor.com/iframe-embed.html#code=def%20for_loop_recur%28n%3A%20int%29%20-%3E%20int%3A%0A%20%20%20%20%22%22%22%E4%BD%BF%E7%94%A8%E8%BF%AD%E4%BB%A3%E6%A8%A1%E6%8B%9F%E9%80%92%E5%BD%92%22%22%22%0A%20%20%20%20%23%20%E4%BD%BF%E7%94%A8%E4%B8%80%E4%B8%AA%E6%98%BE%E5%BC%8F%E7%9A%84%E6%A0%88%E6%9D%A5%E6%A8%A1%E6%8B%9F%E7%B3%BB%E7%BB%9F%E8%B0%83%E7%94%A8%E6%A0%88%0A%20%20%20%20stack%20%3D%20%5B%5D%0A%20%20%20%20res%20%3D%200%0A%20%20%20%20%23%20%E9%80%92%EF%BC%9A%E9%80%92%E5%BD%92%E8%B0%83%E7%94%A8%0A%20%20%20%20for%20i%20in%20range%28n,%200,%20-1%29%3A%0A%20%20%20%20%20%20%20%20%23%20%E9%80%9A%E8%BF%87%E2%80%9C%E5%85%A5%E6%A0%88%E6%93%8D%E4%BD%9C%E2%80%9D%E6%A8%A1%E6%8B%9F%E2%80%9C%E9%80%92%E2%80%9D%0A%20%20%20%20%20%20%20%20stack.append%28i%29%0A%20%20%20%20%23%20%E5%BD%92%EF%BC%9A%E8%BF%94%E5%9B%9E%E7%BB%93%E6%9E%9C%0A%20%20%20%20while%20stack%3A%0A%20%20%20%20%20%20%20%20%23%20%E9%80%9A%E8%BF%87%E2%80%9C%E5%87%BA%E6%A0%88%E6%93%8D%E4%BD%9C%E2%80%9D%E6%A8%A1%E6%8B%9F%E2%80%9C%E5%BD%92%E2%80%9D%0A%20%20%20%20%20%20%20%20res%20%2B%3D%20stack.pop%28%29%0A%20%20%20%20%23%20res%20%3D%201%2B2%2B3%2B...%2Bn%0A%20%20%20%20return%20res%0A%0A%22%22%22Driver%20Code%22%22%22%0Aif%20__name__%20%3D%3D%20%22__main__%22%3A%0A%20%20%20%20n%20%3D%205%0A%20%20%20%20res%20%3D%20for_loop_recur%28n%29%0A%20%20%20%20print%28f%22%5Cn%E4%BD%BF%E7%94%A8%E8%BF%AD%E4%BB%A3%E6%A8%A1%E6%8B%9F%E9%80%92%E5%BD%92%E6%B1%82%E5%92%8C%E7%BB%93%E6%9E%9C%20res%20%3D%20%7Bres%7D%22%29&codeDivHeight=400&codeDivWidth=350&cumulative=false&curInstr=0&heapPrimitives=nevernest&origin=opt-frontend.js&py=311&rawInputLstJSON=%5B%5D&textReferences=false"> </iframe></p>
+</details>
 <p>观察以上代码，当递归转化为迭代后，代码变得更加复杂了。尽管迭代和递归在很多情况下可以互相转化，但不一定值得这样做，有以下两点原因。</p>
 <ul>
 <li>转化后的代码可能更加难以理解，可读性更差。</li>
@ -5423,7 +5455,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_computational_complexity/performance_evaluation/index.html
+++ b/chapter_computational_complexity/performance_evaluation/index.html
@ -3738,7 +3738,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_computational_complexity/space_complexity/index.html
+++ b/chapter_computational_complexity/space_complexity/index.html
@ -5657,7 +5657,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_computational_complexity/summary/index.html
+++ b/chapter_computational_complexity/summary/index.html
@ -3746,7 +3746,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_computational_complexity/time_complexity/index.html
+++ b/chapter_computational_complexity/time_complexity/index.html
@ -6931,7 +6931,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_data_structure/basic_data_types/index.html
+++ b/chapter_data_structure/basic_data_types/index.html
@ -3830,7 +3830,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_data_structure/character_encoding/index.html
+++ b/chapter_data_structure/character_encoding/index.html
@ -3819,7 +3819,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_data_structure/classification_of_data_structure/index.html
+++ b/chapter_data_structure/classification_of_data_structure/index.html
@ -3744,7 +3744,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_data_structure/index.html
+++ b/chapter_data_structure/index.html
@ -3651,7 +3651,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_data_structure/number_encoding/index.html
+++ b/chapter_data_structure/number_encoding/index.html
@ -3843,7 +3843,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_data_structure/summary/index.html
+++ b/chapter_data_structure/summary/index.html
@ -3733,7 +3733,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_divide_and_conquer/binary_search_recur/index.html
+++ b/chapter_divide_and_conquer/binary_search_recur/index.html
@ -4043,7 +4043,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_divide_and_conquer/build_binary_tree_problem/index.html
+++ b/chapter_divide_and_conquer/build_binary_tree_problem/index.html
@ -4206,7 +4206,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_divide_and_conquer/divide_and_conquer/index.html
+++ b/chapter_divide_and_conquer/divide_and_conquer/index.html
@ -3843,7 +3843,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_divide_and_conquer/hanota_problem/index.html
+++ b/chapter_divide_and_conquer/hanota_problem/index.html
@ -4188,7 +4188,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_divide_and_conquer/index.html
+++ b/chapter_divide_and_conquer/index.html
@ -3651,7 +3651,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_divide_and_conquer/summary/index.html
+++ b/chapter_divide_and_conquer/summary/index.html
@ -3639,7 +3639,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_dynamic_programming/dp_problem_features/index.html
+++ b/chapter_dynamic_programming/dp_problem_features/index.html
@ -4485,7 +4485,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_dynamic_programming/dp_solution_pipeline/index.html
+++ b/chapter_dynamic_programming/dp_solution_pipeline/index.html
@ -5065,7 +5065,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_dynamic_programming/edit_distance_problem/index.html
+++ b/chapter_dynamic_programming/edit_distance_problem/index.html
@ -4555,7 +4555,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_dynamic_programming/index.html
+++ b/chapter_dynamic_programming/index.html
@ -3653,7 +3653,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_dynamic_programming/intro_to_dynamic_programming/index.html
+++ b/chapter_dynamic_programming/intro_to_dynamic_programming/index.html
@ -5050,7 +5050,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_dynamic_programming/knapsack_problem/index.html
+++ b/chapter_dynamic_programming/knapsack_problem/index.html
@ -4954,7 +4954,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_dynamic_programming/summary/index.html
+++ b/chapter_dynamic_programming/summary/index.html
@ -3651,7 +3651,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_dynamic_programming/unbounded_knapsack_problem/index.html
+++ b/chapter_dynamic_programming/unbounded_knapsack_problem/index.html
@ -5899,7 +5899,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_graph/graph/index.html
+++ b/chapter_graph/graph/index.html
@ -3865,7 +3865,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_graph/graph_operations/index.html
+++ b/chapter_graph/graph_operations/index.html
@ -5799,7 +5799,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_graph/graph_traversal/index.html
+++ b/chapter_graph/graph_traversal/index.html
@ -4616,7 +4616,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_graph/index.html
+++ b/chapter_graph/index.html
@ -3650,7 +3650,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_graph/summary/index.html
+++ b/chapter_graph/summary/index.html
@ -3730,7 +3730,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_greedy/fractional_knapsack_problem/index.html
+++ b/chapter_greedy/fractional_knapsack_problem/index.html
@ -4162,7 +4162,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_greedy/greedy_algorithm/index.html
+++ b/chapter_greedy/greedy_algorithm/index.html
@ -4055,7 +4055,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_greedy/index.html
+++ b/chapter_greedy/index.html
@ -3651,7 +3651,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_greedy/max_capacity_problem/index.html
+++ b/chapter_greedy/max_capacity_problem/index.html
@ -4066,7 +4066,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_greedy/max_product_cutting_problem/index.html
+++ b/chapter_greedy/max_product_cutting_problem/index.html
@ -4041,7 +4041,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_greedy/summary/index.html
+++ b/chapter_greedy/summary/index.html
@ -3640,7 +3640,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_hashing/hash_algorithm/index.html
+++ b/chapter_hashing/hash_algorithm/index.html
@ -4582,7 +4582,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_hashing/hash_collision/index.html
+++ b/chapter_hashing/hash_collision/index.html
@ -6594,7 +6594,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_hashing/hash_map/index.html
+++ b/chapter_hashing/hash_map/index.html
@ -5312,7 +5312,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_hashing/index.html
+++ b/chapter_hashing/index.html
@ -3650,7 +3650,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_hashing/summary/index.html
+++ b/chapter_hashing/summary/index.html
@ -3745,7 +3745,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_heap/build_heap/index.html
+++ b/chapter_heap/build_heap/index.html
@ -3924,7 +3924,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_heap/heap/index.html
+++ b/chapter_heap/heap/index.html
@ -5313,7 +5313,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_heap/index.html
+++ b/chapter_heap/index.html
@ -3650,7 +3650,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_heap/summary/index.html
+++ b/chapter_heap/summary/index.html
@ -3717,7 +3717,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_heap/top_k/index.html
+++ b/chapter_heap/top_k/index.html
@ -4108,7 +4108,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_introduction/algorithms_are_everywhere/index.html
+++ b/chapter_introduction/algorithms_are_everywhere/index.html
@ -3685,7 +3685,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_introduction/index.html
+++ b/chapter_introduction/index.html
@ -3649,7 +3649,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_introduction/summary/index.html
+++ b/chapter_introduction/summary/index.html
@ -3637,7 +3637,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_introduction/what_is_dsa/index.html
+++ b/chapter_introduction/what_is_dsa/index.html
@ -3789,7 +3789,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_preface/about_the_book/index.html
+++ b/chapter_preface/about_the_book/index.html
@ -3759,7 +3759,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_preface/index.html
+++ b/chapter_preface/index.html
@ -3610,7 +3610,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_preface/suggestions/index.html
+++ b/chapter_preface/suggestions/index.html
@ -3946,7 +3946,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_preface/summary/index.html
+++ b/chapter_preface/summary/index.html
@ -3636,7 +3636,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_reference/index.html
+++ b/chapter_reference/index.html
@ -3533,7 +3533,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_searching/binary_search/index.html
+++ b/chapter_searching/binary_search/index.html
@ -4295,7 +4295,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_searching/binary_search_edge/index.html
+++ b/chapter_searching/binary_search_edge/index.html
@ -4129,7 +4129,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_searching/binary_search_insertion/index.html
+++ b/chapter_searching/binary_search_insertion/index.html
@ -4221,7 +4221,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_searching/index.html
+++ b/chapter_searching/index.html
@ -3652,7 +3652,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_searching/replace_linear_by_hashing/index.html
+++ b/chapter_searching/replace_linear_by_hashing/index.html
@ -4159,7 +4159,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_searching/searching_algorithm_revisited/index.html
+++ b/chapter_searching/searching_algorithm_revisited/index.html
@ -3840,7 +3840,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_searching/summary/index.html
+++ b/chapter_searching/summary/index.html
@ -3636,7 +3636,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_sorting/bubble_sort/index.html
+++ b/chapter_sorting/bubble_sort/index.html
@ -4235,7 +4235,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_sorting/bucket_sort/index.html
+++ b/chapter_sorting/bucket_sort/index.html
@ -4104,7 +4104,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_sorting/counting_sort/index.html
+++ b/chapter_sorting/counting_sort/index.html
@ -4476,7 +4476,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_sorting/heap_sort/index.html
+++ b/chapter_sorting/heap_sort/index.html
@ -4227,7 +4227,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_sorting/index.html
+++ b/chapter_sorting/index.html
@ -3657,7 +3657,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_sorting/insertion_sort/index.html
+++ b/chapter_sorting/insertion_sort/index.html
@ -3955,7 +3955,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_sorting/merge_sort/index.html
+++ b/chapter_sorting/merge_sort/index.html
@ -4342,7 +4342,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_sorting/quick_sort/index.html
+++ b/chapter_sorting/quick_sort/index.html
@ -4964,7 +4964,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_sorting/radix_sort/index.html
+++ b/chapter_sorting/radix_sort/index.html
@ -4365,7 +4365,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_sorting/selection_sort/index.html
+++ b/chapter_sorting/selection_sort/index.html
@ -3954,7 +3954,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_sorting/sorting_algorithm/index.html
+++ b/chapter_sorting/sorting_algorithm/index.html
@ -3735,7 +3735,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_sorting/summary/index.html
+++ b/chapter_sorting/summary/index.html
@ -3743,7 +3743,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_stack_and_queue/deque/index.html
+++ b/chapter_stack_and_queue/deque/index.html
@ -6953,7 +6953,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_stack_and_queue/index.html
+++ b/chapter_stack_and_queue/index.html
@ -3650,7 +3650,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_stack_and_queue/queue/index.html
+++ b/chapter_stack_and_queue/queue/index.html
@ -5838,7 +5838,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_stack_and_queue/stack/index.html
+++ b/chapter_stack_and_queue/stack/index.html
@ -5436,7 +5436,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_stack_and_queue/summary/index.html
+++ b/chapter_stack_and_queue/summary/index.html
@ -3732,7 +3732,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_tree/array_representation_of_tree/index.html
+++ b/chapter_tree/array_representation_of_tree/index.html
@ -4834,7 +4834,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_tree/avl_tree/index.html
+++ b/chapter_tree/avl_tree/index.html
@ -6232,7 +6232,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/chapter_tree/binary_search_tree/index.html
+++ b/chapter_tree/binary_search_tree/index.html
@ -5237,7 +5237,7 @@ aria-label="页脚"
      <div class="md-copyright">
  
    <div class="md-copyright__highlight">
-      Copyright &copy; 2022 - 2023 Krahets
+      Copyright &copy; 2022 - 2024 Krahets
    </div>
  
  
--- a/Show more
+++ b/Show more