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

deploy

Browse source
This commit is contained in:
krahets 2024-04-07 02:41:57 +08:00
parent f24b390d8c
commit 7a28f7f010
53 changed files with 553 additions and 553 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
chapter_appendix/index.html
View file

@ -3600,9 +3600,9 @@
<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>
<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>
<li><a href="https://www.hello-algo.com/chapter_appendix/contribution/">16.2 &nbsp; 一起参与创作</a></li>
<li><a href="https://www.hello-algo.com/chapter_appendix/terminology/">16.3 &nbsp; 术语表</a></li>
<li><a href="installation/">16.1 &nbsp; 编程环境安装</a></li>
<li><a href="contribution/">16.2 &nbsp; 一起参与创作</a></li>
<li><a href="terminology/">16.3 &nbsp; 术语表</a></li>
</ul>
<!-- Source file information -->

10
chapter_array_and_linkedlist/index.html
View file

@ -3605,11 +3605,11 @@
</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_array_and_linkedlist/array/">4.1 &nbsp; 数组</a></li>
<li><a href="https://www.hello-algo.com/chapter_array_and_linkedlist/linked_list/">4.2 &nbsp; 链表</a></li>
<li><a href="https://www.hello-algo.com/chapter_array_and_linkedlist/list/">4.3 &nbsp; 列表</a></li>
<li><a href="https://www.hello-algo.com/chapter_array_and_linkedlist/ram_and_cache/">4.4 &nbsp; 内存与缓存 *</a></li>
<li><a href="https://www.hello-algo.com/chapter_array_and_linkedlist/summary/">4.5 &nbsp; 小结</a></li>
<li><a href="array/">4.1 &nbsp; 数组</a></li>
<li><a href="linked_list/">4.2 &nbsp; 链表</a></li>
<li><a href="list/">4.3 &nbsp; 列表</a></li>
<li><a href="ram_and_cache/">4.4 &nbsp; 内存与缓存 *</a></li>
<li><a href="summary/">4.5 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

10
chapter_backtracking/index.html
View file

@ -3605,11 +3605,11 @@
</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_backtracking/backtracking_algorithm/">13.1 &nbsp; 回溯算法</a></li>
<li><a href="https://www.hello-algo.com/chapter_backtracking/permutations_problem/">13.2 &nbsp; 全排列问题</a></li>
<li><a href="https://www.hello-algo.com/chapter_backtracking/subset_sum_problem/">13.3 &nbsp; 子集和问题</a></li>
<li><a href="https://www.hello-algo.com/chapter_backtracking/n_queens_problem/">13.4 &nbsp; N 皇后问题</a></li>
<li><a href="https://www.hello-algo.com/chapter_backtracking/summary/">13.5 &nbsp; 小结</a></li>
<li><a href="backtracking_algorithm/">13.1 &nbsp; 回溯算法</a></li>
<li><a href="permutations_problem/">13.2 &nbsp; 全排列问题</a></li>
<li><a href="subset_sum_problem/">13.3 &nbsp; 子集和问题</a></li>
<li><a href="n_queens_problem/">13.4 &nbsp; N 皇后问题</a></li>
<li><a href="summary/">13.5 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

10
chapter_computational_complexity/index.html
View file

@ -3605,11 +3605,11 @@
</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_computational_complexity/performance_evaluation/">2.1 &nbsp; 算法效率评估</a></li>
<li><a href="https://www.hello-algo.com/chapter_computational_complexity/iteration_and_recursion/">2.2 &nbsp; 迭代与递归</a></li>
<li><a href="https://www.hello-algo.com/chapter_computational_complexity/time_complexity/">2.3 &nbsp; 时间复杂度</a></li>
<li><a href="https://www.hello-algo.com/chapter_computational_complexity/space_complexity/">2.4 &nbsp; 空间复杂度</a></li>
<li><a href="https://www.hello-algo.com/chapter_computational_complexity/summary/">2.5 &nbsp; 小结</a></li>
<li><a href="performance_evaluation/">2.1 &nbsp; 算法效率评估</a></li>
<li><a href="iteration_and_recursion/">2.2 &nbsp; 迭代与递归</a></li>
<li><a href="time_complexity/">2.3 &nbsp; 时间复杂度</a></li>
<li><a href="space_complexity/">2.4 &nbsp; 空间复杂度</a></li>
<li><a href="summary/">2.5 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

10
chapter_data_structure/index.html
View file

@ -3605,11 +3605,11 @@
</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_data_structure/classification_of_data_structure/">3.1 &nbsp; 数据结构分类</a></li>
<li><a href="https://www.hello-algo.com/chapter_data_structure/basic_data_types/">3.2 &nbsp; 基本数据类型</a></li>
<li><a href="https://www.hello-algo.com/chapter_data_structure/number_encoding/">3.3 &nbsp; 数字编码 *</a></li>
<li><a href="https://www.hello-algo.com/chapter_data_structure/character_encoding/">3.4 &nbsp; 字符编码 *</a></li>
<li><a href="https://www.hello-algo.com/chapter_data_structure/summary/">3.5 &nbsp; 小结</a></li>
<li><a href="classification_of_data_structure/">3.1 &nbsp; 数据结构分类</a></li>
<li><a href="basic_data_types/">3.2 &nbsp; 基本数据类型</a></li>
<li><a href="number_encoding/">3.3 &nbsp; 数字编码 *</a></li>
<li><a href="character_encoding/">3.4 &nbsp; 字符编码 *</a></li>
<li><a href="summary/">3.5 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

10
chapter_divide_and_conquer/index.html
View file

@ -3605,11 +3605,11 @@
</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_divide_and_conquer/divide_and_conquer/">12.1 &nbsp; 分治算法</a></li>
<li><a href="https://www.hello-algo.com/chapter_divide_and_conquer/binary_search_recur/">12.2 &nbsp; 分治搜索策略</a></li>
<li><a href="https://www.hello-algo.com/chapter_divide_and_conquer/build_binary_tree_problem/">12.3 &nbsp; 构建树问题</a></li>
<li><a href="https://www.hello-algo.com/chapter_divide_and_conquer/hanota_problem/">12.4 &nbsp; 汉诺塔问题</a></li>
<li><a href="https://www.hello-algo.com/chapter_divide_and_conquer/summary/">12.5 &nbsp; 小结</a></li>
<li><a href="divide_and_conquer/">12.1 &nbsp; 分治算法</a></li>
<li><a href="binary_search_recur/">12.2 &nbsp; 分治搜索策略</a></li>
<li><a href="build_binary_tree_problem/">12.3 &nbsp; 构建树问题</a></li>
<li><a href="hanota_problem/">12.4 &nbsp; 汉诺塔问题</a></li>
<li><a href="summary/">12.5 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

14
chapter_dynamic_programming/index.html
View file

@ -3605,13 +3605,13 @@
</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_dynamic_programming/intro_to_dynamic_programming/">14.1 &nbsp; 初探动态规划</a></li>
<li><a href="https://www.hello-algo.com/chapter_dynamic_programming/dp_problem_features/">14.2 &nbsp; DP 问题特性</a></li>
<li><a href="https://www.hello-algo.com/chapter_dynamic_programming/dp_solution_pipeline/">14.3 &nbsp; DP 解题思路</a></li>
<li><a href="https://www.hello-algo.com/chapter_dynamic_programming/knapsack_problem/">14.4 &nbsp; 0-1 背包问题</a></li>
<li><a href="https://www.hello-algo.com/chapter_dynamic_programming/unbounded_knapsack_problem/">14.5 &nbsp; 完全背包问题</a></li>
<li><a href="https://www.hello-algo.com/chapter_dynamic_programming/edit_distance_problem/">14.6 &nbsp; 编辑距离问题</a></li>
<li><a href="https://www.hello-algo.com/chapter_dynamic_programming/summary/">14.7 &nbsp; 小结</a></li>
<li><a href="intro_to_dynamic_programming/">14.1 &nbsp; 初探动态规划</a></li>
<li><a href="dp_problem_features/">14.2 &nbsp; DP 问题特性</a></li>
<li><a href="dp_solution_pipeline/">14.3 &nbsp; DP 解题思路</a></li>
<li><a href="knapsack_problem/">14.4 &nbsp; 0-1 背包问题</a></li>
<li><a href="unbounded_knapsack_problem/">14.5 &nbsp; 完全背包问题</a></li>
<li><a href="edit_distance_problem/">14.6 &nbsp; 编辑距离问题</a></li>
<li><a href="summary/">14.7 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

8
chapter_graph/index.html
View file

@ -3605,10 +3605,10 @@
</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_graph/graph/">9.1 &nbsp; 图</a></li>
<li><a href="https://www.hello-algo.com/chapter_graph/graph_operations/">9.2 &nbsp; 图基础操作</a></li>
<li><a href="https://www.hello-algo.com/chapter_graph/graph_traversal/">9.3 &nbsp; 图的遍历</a></li>
<li><a href="https://www.hello-algo.com/chapter_graph/summary/">9.4 &nbsp; 小结</a></li>
<li><a href="graph/">9.1 &nbsp; 图</a></li>
<li><a href="graph_operations/">9.2 &nbsp; 图基础操作</a></li>
<li><a href="graph_traversal/">9.3 &nbsp; 图的遍历</a></li>
<li><a href="summary/">9.4 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

10
chapter_greedy/index.html
View file

@ -3605,11 +3605,11 @@
</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_greedy/greedy_algorithm/">15.1 &nbsp; 贪心算法</a></li>
<li><a href="https://www.hello-algo.com/chapter_greedy/fractional_knapsack_problem/">15.2 &nbsp; 分数背包问题</a></li>
<li><a href="https://www.hello-algo.com/chapter_greedy/max_capacity_problem/">15.3 &nbsp; 最大容量问题</a></li>
<li><a href="https://www.hello-algo.com/chapter_greedy/max_product_cutting_problem/">15.4 &nbsp; 最大切分乘积问题</a></li>
<li><a href="https://www.hello-algo.com/chapter_greedy/summary/">15.5 &nbsp; 小结</a></li>
<li><a href="greedy_algorithm/">15.1 &nbsp; 贪心算法</a></li>
<li><a href="fractional_knapsack_problem/">15.2 &nbsp; 分数背包问题</a></li>
<li><a href="max_capacity_problem/">15.3 &nbsp; 最大容量问题</a></li>
<li><a href="max_product_cutting_problem/">15.4 &nbsp; 最大切分乘积问题</a></li>
<li><a href="summary/">15.5 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

8
chapter_hashing/index.html
View file

@ -3605,10 +3605,10 @@
</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_hashing/hash_map/">6.1 &nbsp; 哈希表</a></li>
<li><a href="https://www.hello-algo.com/chapter_hashing/hash_collision/">6.2 &nbsp; 哈希冲突</a></li>
<li><a href="https://www.hello-algo.com/chapter_hashing/hash_algorithm/">6.3 &nbsp; 哈希算法</a></li>
<li><a href="https://www.hello-algo.com/chapter_hashing/summary/">6.4 &nbsp; 小结</a></li>
<li><a href="hash_map/">6.1 &nbsp; 哈希表</a></li>
<li><a href="hash_collision/">6.2 &nbsp; 哈希冲突</a></li>
<li><a href="hash_algorithm/">6.3 &nbsp; 哈希算法</a></li>
<li><a href="summary/">6.4 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

8
chapter_heap/index.html
View file

@ -3605,10 +3605,10 @@
</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_heap/heap/">8.1 &nbsp; 堆</a></li>
<li><a href="https://www.hello-algo.com/chapter_heap/build_heap/">8.2 &nbsp; 建堆操作</a></li>
<li><a href="https://www.hello-algo.com/chapter_heap/top_k/">8.3 &nbsp; Top-k 问题</a></li>
<li><a href="https://www.hello-algo.com/chapter_heap/summary/">8.4 &nbsp; 小结</a></li>
<li><a href="heap/">8.1 &nbsp; 堆</a></li>
<li><a href="build_heap/">8.2 &nbsp; 建堆操作</a></li>
<li><a href="top_k/">8.3 &nbsp; Top-k 问题</a></li>
<li><a href="summary/">8.4 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

6
chapter_introduction/index.html
View file

@ -3605,9 +3605,9 @@
</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_introduction/algorithms_are_everywhere/">1.1 &nbsp; 算法无处不在</a></li>
<li><a href="https://www.hello-algo.com/chapter_introduction/what_is_dsa/">1.2 &nbsp; 算法是什么</a></li>
<li><a href="https://www.hello-algo.com/chapter_introduction/summary/">1.3 &nbsp; 小结</a></li>
<li><a href="algorithms_are_everywhere/">1.1 &nbsp; 算法无处不在</a></li>
<li><a href="what_is_dsa/">1.2 &nbsp; 算法是什么</a></li>
<li><a href="summary/">1.3 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

6
chapter_preface/index.html
View file

@ -3605,9 +3605,9 @@
</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_preface/about_the_book/">0.1 &nbsp; 关于本书</a></li>
<li><a href="https://www.hello-algo.com/chapter_preface/suggestions/">0.2 &nbsp; 如何使用本书</a></li>
<li><a href="https://www.hello-algo.com/chapter_preface/summary/">0.3 &nbsp; 小结</a></li>
<li><a href="about_the_book/">0.1 &nbsp; 关于本书</a></li>
<li><a href="suggestions/">0.2 &nbsp; 如何使用本书</a></li>
<li><a href="summary/">0.3 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

12
chapter_searching/index.html
View file

@ -3605,12 +3605,12 @@
</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_searching/binary_search/">10.1 &nbsp; 二分查找</a></li>
<li><a href="https://www.hello-algo.com/chapter_searching/binary_search_insertion/">10.2 &nbsp; 二分查找插入点</a></li>
<li><a href="https://www.hello-algo.com/chapter_searching/binary_search_edge/">10.3 &nbsp; 二分查找边界</a></li>
<li><a href="https://www.hello-algo.com/chapter_searching/replace_linear_by_hashing/">10.4 &nbsp; 哈希优化策略</a></li>
<li><a href="https://www.hello-algo.com/chapter_searching/searching_algorithm_revisited/">10.5 &nbsp; 重识搜索算法</a></li>
<li><a href="https://www.hello-algo.com/chapter_searching/summary/">10.6 &nbsp; 小结</a></li>
<li><a href="binary_search/">10.1 &nbsp; 二分查找</a></li>
<li><a href="binary_search_insertion/">10.2 &nbsp; 二分查找插入点</a></li>
<li><a href="binary_search_edge/">10.3 &nbsp; 二分查找边界</a></li>
<li><a href="replace_linear_by_hashing/">10.4 &nbsp; 哈希优化策略</a></li>
<li><a href="searching_algorithm_revisited/">10.5 &nbsp; 重识搜索算法</a></li>
<li><a href="summary/">10.6 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

22
chapter_sorting/index.html
View file

@ -3605,17 +3605,17 @@
</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_sorting/sorting_algorithm/">11.1 &nbsp; 排序算法</a></li>
<li><a href="https://www.hello-algo.com/chapter_sorting/selection_sort/">11.2 &nbsp; 选择排序</a></li>
<li><a href="https://www.hello-algo.com/chapter_sorting/bubble_sort/">11.3 &nbsp; 冒泡排序</a></li>
<li><a href="https://www.hello-algo.com/chapter_sorting/insertion_sort/">11.4 &nbsp; 插入排序</a></li>
<li><a href="https://www.hello-algo.com/chapter_sorting/quick_sort/">11.5 &nbsp; 快速排序</a></li>
<li><a href="https://www.hello-algo.com/chapter_sorting/merge_sort/">11.6 &nbsp; 归并排序</a></li>
<li><a href="https://www.hello-algo.com/chapter_sorting/heap_sort/">11.7 &nbsp; 堆排序</a></li>
<li><a href="https://www.hello-algo.com/chapter_sorting/bucket_sort/">11.8 &nbsp; 桶排序</a></li>
<li><a href="https://www.hello-algo.com/chapter_sorting/counting_sort/">11.9 &nbsp; 计数排序</a></li>
<li><a href="https://www.hello-algo.com/chapter_sorting/radix_sort/">11.10 &nbsp; 基数排序</a></li>
<li><a href="https://www.hello-algo.com/chapter_sorting/summary/">11.11 &nbsp; 小结</a></li>
<li><a href="sorting_algorithm/">11.1 &nbsp; 排序算法</a></li>
<li><a href="selection_sort/">11.2 &nbsp; 选择排序</a></li>
<li><a href="bubble_sort/">11.3 &nbsp; 冒泡排序</a></li>
<li><a href="insertion_sort/">11.4 &nbsp; 插入排序</a></li>
<li><a href="quick_sort/">11.5 &nbsp; 快速排序</a></li>
<li><a href="merge_sort/">11.6 &nbsp; 归并排序</a></li>
<li><a href="heap_sort/">11.7 &nbsp; 堆排序</a></li>
<li><a href="bucket_sort/">11.8 &nbsp; 桶排序</a></li>
<li><a href="counting_sort/">11.9 &nbsp; 计数排序</a></li>
<li><a href="radix_sort/">11.10 &nbsp; 基数排序</a></li>
<li><a href="summary/">11.11 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

8
chapter_stack_and_queue/index.html
View file

@ -3605,10 +3605,10 @@
</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_stack_and_queue/stack/">5.1 &nbsp; 栈</a></li>
<li><a href="https://www.hello-algo.com/chapter_stack_and_queue/queue/">5.2 &nbsp; 队列</a></li>
<li><a href="https://www.hello-algo.com/chapter_stack_and_queue/deque/">5.3 &nbsp; 双向队列</a></li>
<li><a href="https://www.hello-algo.com/chapter_stack_and_queue/summary/">5.4 &nbsp; 小结</a></li>
<li><a href="stack/">5.1 &nbsp; 栈</a></li>
<li><a href="queue/">5.2 &nbsp; 队列</a></li>
<li><a href="deque/">5.3 &nbsp; 双向队列</a></li>
<li><a href="summary/">5.4 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

12
chapter_tree/index.html
View file

@ -3605,12 +3605,12 @@
</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_tree/binary_tree/">7.1 &nbsp; 二叉树</a></li>
<li><a href="https://www.hello-algo.com/chapter_tree/binary_tree_traversal/">7.2 &nbsp; 二叉树遍历</a></li>
<li><a href="https://www.hello-algo.com/chapter_tree/array_representation_of_tree/">7.3 &nbsp; 二叉树数组表示</a></li>
<li><a href="https://www.hello-algo.com/chapter_tree/binary_search_tree/">7.4 &nbsp; 二叉搜索树</a></li>
<li><a href="https://www.hello-algo.com/chapter_tree/avl_tree/">7.5 &nbsp; AVL 树 *</a></li>
<li><a href="https://www.hello-algo.com/chapter_tree/summary/">7.6 &nbsp; 小结</a></li>
<li><a href="binary_tree/">7.1 &nbsp; 二叉树</a></li>
<li><a href="binary_tree_traversal/">7.2 &nbsp; 二叉树遍历</a></li>
<li><a href="array_representation_of_tree/">7.3 &nbsp; 二叉树数组表示</a></li>
<li><a href="binary_search_tree/">7.4 &nbsp; 二叉搜索树</a></li>
<li><a href="avl_tree/">7.5 &nbsp; AVL 树 *</a></li>
<li><a href="summary/">7.6 &nbsp; 小结</a></li>
</ul>
<!-- Source file information -->

14
en/chapter_array_and_linkedlist/index.html
View file

@ -1967,7 +1967,7 @@
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
Chapter contents
</span>
</a>
@ -2016,13 +2016,13 @@
<p>The world of data structures resembles a sturdy brick wall.</p>
<p>In arrays, envision bricks snugly aligned, each resting seamlessly beside the next, creating a unified formation. Meanwhile, in linked lists, these bricks disperse freely, embraced by vines gracefully knitting connections between them.</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="chapter-contents">Chapter contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_array_and_linkedlist/array/">4.1 &nbsp; Array</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_array_and_linkedlist/linked_list/">4.2 &nbsp; Linked list</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_array_and_linkedlist/list/">4.3 &nbsp; List</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_array_and_linkedlist/ram_and_cache/">4.4 &nbsp; Memory and cache</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_array_and_linkedlist/summary/">4.5 &nbsp; Summary</a></li>
<li><a href="array/">4.1 &nbsp; Array</a></li>
<li><a href="linked_list/">4.2 &nbsp; Linked list</a></li>
<li><a href="list/">4.3 &nbsp; List</a></li>
<li><a href="ram_and_cache/">4.4 &nbsp; Memory and cache</a></li>
<li><a href="summary/">4.5 &nbsp; Summary</a></li>
</ul>
<!-- Source file information -->

14
en/chapter_computational_complexity/index.html
View file

@ -1967,7 +1967,7 @@
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
Chapter contents
</span>
</a>
@ -2016,13 +2016,13 @@
<p>Complexity analysis is like a space-time navigator in the vast universe of algorithms.</p>
<p>It guides us in exploring deeper within the the dimensions of time and space, seeking more elegant solutions.</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="chapter-contents">Chapter contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_computational_complexity/performance_evaluation/">2.1 &nbsp; Algorithm efficiency assessment</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_computational_complexity/iteration_and_recursion/">2.2 &nbsp; Iteration and recursion</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_computational_complexity/time_complexity/">2.3 &nbsp; Time complexity</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_computational_complexity/space_complexity/">2.4 &nbsp; Space complexity</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_computational_complexity/summary/">2.5 &nbsp; Summary</a></li>
<li><a href="performance_evaluation/">2.1 &nbsp; Algorithm efficiency assessment</a></li>
<li><a href="iteration_and_recursion/">2.2 &nbsp; Iteration and recursion</a></li>
<li><a href="time_complexity/">2.3 &nbsp; Time complexity</a></li>
<li><a href="space_complexity/">2.4 &nbsp; Space complexity</a></li>
<li><a href="summary/">2.5 &nbsp; Summary</a></li>
</ul>
<!-- Source file information -->

14
en/chapter_data_structure/index.html
View file

@ -1967,7 +1967,7 @@
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
Chapter contents
</span>
</a>
@ -2016,13 +2016,13 @@
<p>Data structures serve as a robust and diverse framework.</p>
<p>They offer a blueprint for the orderly organization of data, upon which algorithms come to life.</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="chapter-contents">Chapter contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_data_structure/classification_of_data_structure/">3.1 &nbsp; Classification of data structures</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_data_structure/basic_data_types/">3.2 &nbsp; Fundamental data types</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_data_structure/number_encoding/">3.3 &nbsp; Number encoding *</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_data_structure/character_encoding/">3.4 &nbsp; Character encoding *</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_data_structure/summary/">3.5 &nbsp; Summary</a></li>
<li><a href="classification_of_data_structure/">3.1 &nbsp; Classification of data structures</a></li>
<li><a href="basic_data_types/">3.2 &nbsp; Fundamental data types</a></li>
<li><a href="number_encoding/">3.3 &nbsp; Number encoding *</a></li>
<li><a href="character_encoding/">3.4 &nbsp; Character encoding *</a></li>
<li><a href="summary/">3.5 &nbsp; Summary</a></li>
</ul>
<!-- Source file information -->

12
en/chapter_graph/index.html
View file

@ -1967,7 +1967,7 @@
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
Chapter contents
</span>
</a>
@ -2016,12 +2016,12 @@
<p>In the journey of life, we are like individual nodes, connected by countless invisible edges.</p>
<p>Every encountering and parting leaves a unique mark on this vast network graph.</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="chapter-contents">Chapter contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_graph/graph/">9.1 &nbsp; Graph</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_graph/graph_operations/">9.2 &nbsp; Basic Graph Operations</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_graph/graph_traversal/">9.3 &nbsp; Graph Traversal</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_graph/summary/">9.4 &nbsp; Summary</a></li>
<li><a href="graph/">9.1 &nbsp; Graph</a></li>
<li><a href="graph_operations/">9.2 &nbsp; Basic Graph Operations</a></li>
<li><a href="graph_traversal/">9.3 &nbsp; Graph Traversal</a></li>
<li><a href="summary/">9.4 &nbsp; Summary</a></li>
</ul>
<!-- Source file information -->

12
en/chapter_hashing/index.html
View file

@ -1967,7 +1967,7 @@
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
Chapter contents
</span>
</a>
@ -2016,12 +2016,12 @@
<p>In the world of computing, a hash table is akin to an intelligent librarian.</p>
<p>It understands how to compute index numbers, enabling swift retrieval of the desired book.</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="chapter-contents">Chapter contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_hashing/hash_map/">6.1 &nbsp; Hash table</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_hashing/hash_collision/">6.2 &nbsp; Hash collision</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_hashing/hash_algorithm/">6.3 &nbsp; Hash algorithm</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_hashing/summary/">6.4 &nbsp; Summary</a></li>
<li><a href="hash_map/">6.1 &nbsp; Hash table</a></li>
<li><a href="hash_collision/">6.2 &nbsp; Hash collision</a></li>
<li><a href="hash_algorithm/">6.3 &nbsp; Hash algorithm</a></li>
<li><a href="summary/">6.4 &nbsp; Summary</a></li>
</ul>
<!-- Source file information -->

12
en/chapter_heap/index.html
View file

@ -1967,7 +1967,7 @@
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
Chapter contents
</span>
</a>
@ -2016,12 +2016,12 @@
<p>The heap is like mountain peaks, stacked and undulating, each with its unique shape.</p>
<p>Among these peaks, the highest one always catches the eye first.</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="chapter-contents">Chapter contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_heap/heap/">8.1 &nbsp; Heap</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_heap/build_heap/">8.2 &nbsp; Building a Heap</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_heap/top_k/">8.3 &nbsp; Top-k Problem</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_heap/summary/">8.4 &nbsp; Summary</a></li>
<li><a href="heap/">8.1 &nbsp; Heap</a></li>
<li><a href="build_heap/">8.2 &nbsp; Building a Heap</a></li>
<li><a href="top_k/">8.3 &nbsp; Top-k Problem</a></li>
<li><a href="summary/">8.4 &nbsp; Summary</a></li>
</ul>
<!-- Source file information -->

10
en/chapter_introduction/index.html
View file

@ -1967,7 +1967,7 @@
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
Chapter contents
</span>
</a>
@ -2016,11 +2016,11 @@
<p>A graceful maiden dances, intertwined with the data, her skirt swaying to the melody of algorithms.</p>
<p>She invites you to a dance, follow her steps, and enter the world of algorithms full of logic and beauty.</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="chapter-contents">Chapter contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_introduction/algorithms_are_everywhere/">1.1 &nbsp; Algorithms are everywhere</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_introduction/what_is_dsa/">1.2 &nbsp; What is an algorithm</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_introduction/summary/">1.3 &nbsp; Summary</a></li>
<li><a href="algorithms_are_everywhere/">1.1 &nbsp; Algorithms are everywhere</a></li>
<li><a href="what_is_dsa/">1.2 &nbsp; What is an algorithm</a></li>
<li><a href="summary/">1.3 &nbsp; Summary</a></li>
</ul>
<!-- Source file information -->

10
en/chapter_preface/index.html
View file

@ -1965,7 +1965,7 @@
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
Chapter contents
</span>
</a>
@ -2014,11 +2014,11 @@
<p>Algorithms are like a beautiful symphony, with each line of code flowing like a rhythm.</p>
<p>May this book ring softly in your mind, leaving a unique and profound melody.</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="chapter-contents">Chapter contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_preface/about_the_book/">0.1 &nbsp; About this book</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_preface/suggestions/">0.2 &nbsp; How to read</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_preface/summary/">0.3 &nbsp; Summary</a></li>
<li><a href="about_the_book/">0.1 &nbsp; About this book</a></li>
<li><a href="suggestions/">0.2 &nbsp; How to read</a></li>
<li><a href="summary/">0.3 &nbsp; Summary</a></li>
</ul>
<!-- Source file information -->

12
en/chapter_stack_and_queue/index.html
View file

@ -1967,7 +1967,7 @@
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
Chapter contents
</span>
</a>
@ -2016,12 +2016,12 @@
<p>A stack is like cats placed on top of each other, while a queue is like cats lined up one by one.</p>
<p>They represent the logical relationships of Last-In-First-Out (LIFO) and First-In-First-Out (FIFO), respectively.</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="chapter-contents">Chapter contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_stack_and_queue/stack/">5.1 &nbsp; Stack</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_stack_and_queue/queue/">5.2 &nbsp; Queue</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_stack_and_queue/deque/">5.3 &nbsp; Double-ended queue</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_stack_and_queue/summary/">5.4 &nbsp; Summary</a></li>
<li><a href="stack/">5.1 &nbsp; Stack</a></li>
<li><a href="queue/">5.2 &nbsp; Queue</a></li>
<li><a href="deque/">5.3 &nbsp; Double-ended queue</a></li>
<li><a href="summary/">5.4 &nbsp; Summary</a></li>
</ul>
<!-- Source file information -->

16
en/chapter_tree/index.html
View file

@ -1967,7 +1967,7 @@
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
Chapter contents
</span>
</a>
@ -2016,14 +2016,14 @@
<p>The towering tree, full of vitality with its roots deep and leaves lush, branches spreading wide.</p>
<p>It vividly demonstrates the form of data divide-and-conquer.</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="chapter-contents">Chapter contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_tree/binary_tree/">7.1 &nbsp; Binary Tree</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_tree/binary_tree_traversal/">7.2 &nbsp; Binary Tree Traversal</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_tree/array_representation_of_tree/">7.3 &nbsp; Array Representation of Tree</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_tree/binary_search_tree/">7.4 &nbsp; Binary Search Tree</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_tree/avl_tree/">7.5 &nbsp; AVL Tree *</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_tree/summary/">7.6 &nbsp; Summary</a></li>
<li><a href="binary_tree/">7.1 &nbsp; Binary Tree</a></li>
<li><a href="binary_tree_traversal/">7.2 &nbsp; Binary Tree Traversal</a></li>
<li><a href="array_representation_of_tree/">7.3 &nbsp; Array Representation of Tree</a></li>
<li><a href="binary_search_tree/">7.4 &nbsp; Binary Search Tree</a></li>
<li><a href="avl_tree/">7.5 &nbsp; AVL Tree *</a></li>
<li><a href="summary/">7.6 &nbsp; Summary</a></li>
</ul>
<!-- Source file information -->

2
en/search/search_index.json
View file

File diff suppressed because one or more lines are too long

108
en/sitemap.xml
View file

@ -2,272 +2,272 @@
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://www.hello-algo.com/en/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/array/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/linked_list/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/list/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/ram_and_cache/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/iteration_and_recursion/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/performance_evaluation/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/space_complexity/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/time_complexity/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/basic_data_types/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/character_encoding/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/classification_of_data_structure/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/number_encoding/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_graph/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_graph/graph/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_graph/graph_operations/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_graph/graph_traversal/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_graph/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_hashing/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_hashing/hash_algorithm/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_hashing/hash_collision/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_hashing/hash_map/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_hashing/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_heap/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_heap/build_heap/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_heap/heap/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_heap/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_heap/top_k/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_introduction/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_introduction/algorithms_are_everywhere/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_introduction/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_introduction/what_is_dsa/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_preface/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_preface/about_the_book/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_preface/suggestions/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_preface/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/deque/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/queue/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/stack/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_tree/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_tree/array_representation_of_tree/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_tree/avl_tree/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_tree/binary_search_tree/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_tree/binary_tree/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_tree/binary_tree_traversal/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_tree/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
</urlset>

BIN
en/sitemap.xml.gz
View file

Binary file not shown.

212
sitemap.xml
View file

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

BIN
sitemap.xml.gz
View file

Binary file not shown.

12
zh-hant/chapter_appendix/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3533,11 +3533,11 @@
<!-- Page content -->
<h1 id="16">第 16 章 &nbsp; 附錄<a class="headerlink" href="#16" title="Permanent link">&para;</a></h1>
<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>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_appendix/installation/">16.1 &nbsp; 程式設計環境安裝</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_appendix/contribution/">16.2 &nbsp; 一起參與創作</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_appendix/terminology/">16.3 &nbsp; 術語表</a></li>
<li><a href="installation/">16.1 &nbsp; 程式設計環境安裝</a></li>
<li><a href="contribution/">16.2 &nbsp; 一起參與創作</a></li>
<li><a href="terminology/">16.3 &nbsp; 術語表</a></li>
</ul>
<!-- Source file information -->

16
zh-hant/chapter_array_and_linkedlist/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,13 +3538,13 @@
<p>資料結構的世界如同一堵厚實的磚牆。</p>
<p>陣列的磚塊整齊排列，逐個緊貼。鏈結串列的磚塊分散各處，連線的藤蔓自由地穿梭於磚縫之間。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_array_and_linkedlist/array/">4.1 &nbsp; 陣列</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_array_and_linkedlist/linked_list/">4.2 &nbsp; 鏈結串列</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_array_and_linkedlist/list/">4.3 &nbsp; 串列</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_array_and_linkedlist/ram_and_cache/">4.4 &nbsp; 記憶體與快取 *</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_array_and_linkedlist/summary/">4.5 &nbsp; 小結</a></li>
<li><a href="array/">4.1 &nbsp; 陣列</a></li>
<li><a href="linked_list/">4.2 &nbsp; 鏈結串列</a></li>
<li><a href="list/">4.3 &nbsp; 串列</a></li>
<li><a href="ram_and_cache/">4.4 &nbsp; 記憶體與快取 *</a></li>
<li><a href="summary/">4.5 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

16
zh-hant/chapter_backtracking/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,13 +3538,13 @@
<p>我們如同迷宮中的探索者，在前進的道路上可能會遇到困難。</p>
<p>回溯的力量讓我們能夠重新開始，不斷嘗試，最終找到通往光明的出口。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_backtracking/backtracking_algorithm/">13.1 &nbsp; 回溯演算法</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_backtracking/permutations_problem/">13.2 &nbsp; 全排列問題</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_backtracking/subset_sum_problem/">13.3 &nbsp; 子集和問題</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_backtracking/n_queens_problem/">13.4 &nbsp; N 皇后問題</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_backtracking/summary/">13.5 &nbsp; 小結</a></li>
<li><a href="backtracking_algorithm/">13.1 &nbsp; 回溯演算法</a></li>
<li><a href="permutations_problem/">13.2 &nbsp; 全排列問題</a></li>
<li><a href="subset_sum_problem/">13.3 &nbsp; 子集和問題</a></li>
<li><a href="n_queens_problem/">13.4 &nbsp; N 皇后問題</a></li>
<li><a href="summary/">13.5 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

16
zh-hant/chapter_computational_complexity/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,13 +3538,13 @@
<p>複雜度分析猶如浩瀚的演算法宇宙中的時空嚮導。</p>
<p>它帶領我們在時間與空間這兩個維度上深入探索，尋找更優雅的解決方案。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_computational_complexity/performance_evaluation/">2.1 &nbsp; 演算法效率評估</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_computational_complexity/iteration_and_recursion/">2.2 &nbsp; 迭代與遞迴</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_computational_complexity/time_complexity/">2.3 &nbsp; 時間複雜度</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_computational_complexity/space_complexity/">2.4 &nbsp; 空間複雜度</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_computational_complexity/summary/">2.5 &nbsp; 小結</a></li>
<li><a href="performance_evaluation/">2.1 &nbsp; 演算法效率評估</a></li>
<li><a href="iteration_and_recursion/">2.2 &nbsp; 迭代與遞迴</a></li>
<li><a href="time_complexity/">2.3 &nbsp; 時間複雜度</a></li>
<li><a href="space_complexity/">2.4 &nbsp; 空間複雜度</a></li>
<li><a href="summary/">2.5 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

16
zh-hant/chapter_data_structure/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,13 +3538,13 @@
<p>資料結構如同一副穩固而多樣的框架。</p>
<p>它為資料的有序組織提供了藍圖，演算法得以在此基礎上生動起來。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_data_structure/classification_of_data_structure/">3.1 &nbsp; 資料結構分類</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_data_structure/basic_data_types/">3.2 &nbsp; 基本資料型別</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_data_structure/number_encoding/">3.3 &nbsp; 數字編碼 *</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_data_structure/character_encoding/">3.4 &nbsp; 字元編碼 *</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_data_structure/summary/">3.5 &nbsp; 小結</a></li>
<li><a href="classification_of_data_structure/">3.1 &nbsp; 資料結構分類</a></li>
<li><a href="basic_data_types/">3.2 &nbsp; 基本資料型別</a></li>
<li><a href="number_encoding/">3.3 &nbsp; 數字編碼 *</a></li>
<li><a href="character_encoding/">3.4 &nbsp; 字元編碼 *</a></li>
<li><a href="summary/">3.5 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

16
zh-hant/chapter_divide_and_conquer/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,13 +3538,13 @@
<p>難題被逐層拆解，每一次的拆解都使它變得更為簡單。</p>
<p>分而治之揭示了一個重要的事實：從簡單做起，一切都不再複雜。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_divide_and_conquer/divide_and_conquer/">12.1 &nbsp; 分治演算法</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_divide_and_conquer/binary_search_recur/">12.2 &nbsp; 分治搜尋策略</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_divide_and_conquer/build_binary_tree_problem/">12.3 &nbsp; 構建樹問題</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_divide_and_conquer/hanota_problem/">12.4 &nbsp; 河內塔問題</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_divide_and_conquer/summary/">12.5 &nbsp; 小結</a></li>
<li><a href="divide_and_conquer/">12.1 &nbsp; 分治演算法</a></li>
<li><a href="binary_search_recur/">12.2 &nbsp; 分治搜尋策略</a></li>
<li><a href="build_binary_tree_problem/">12.3 &nbsp; 構建樹問題</a></li>
<li><a href="hanota_problem/">12.4 &nbsp; 河內塔問題</a></li>
<li><a href="summary/">12.5 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

20
zh-hant/chapter_dynamic_programming/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,15 +3538,15 @@
<p>小溪匯入河流，江河匯入大海。</p>
<p>動態規劃將小問題的解彙集成大問題的答案，一步步引領我們走向解決問題的彼岸。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_dynamic_programming/intro_to_dynamic_programming/">14.1 &nbsp; 初探動態規劃</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_dynamic_programming/dp_problem_features/">14.2 &nbsp; DP 問題特性</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_dynamic_programming/dp_solution_pipeline/">14.3 &nbsp; DP 解題思路</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_dynamic_programming/knapsack_problem/">14.4 &nbsp; 0-1 背包問題</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_dynamic_programming/unbounded_knapsack_problem/">14.5 &nbsp; 完全背包問題</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_dynamic_programming/edit_distance_problem/">14.6 &nbsp; 編輯距離問題</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_dynamic_programming/summary/">14.7 &nbsp; 小結</a></li>
<li><a href="intro_to_dynamic_programming/">14.1 &nbsp; 初探動態規劃</a></li>
<li><a href="dp_problem_features/">14.2 &nbsp; DP 問題特性</a></li>
<li><a href="dp_solution_pipeline/">14.3 &nbsp; DP 解題思路</a></li>
<li><a href="knapsack_problem/">14.4 &nbsp; 0-1 背包問題</a></li>
<li><a href="unbounded_knapsack_problem/">14.5 &nbsp; 完全背包問題</a></li>
<li><a href="edit_distance_problem/">14.6 &nbsp; 編輯距離問題</a></li>
<li><a href="summary/">14.7 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

14
zh-hant/chapter_graph/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,12 +3538,12 @@
<p>在生命旅途中，我們就像是一個個節點，被無數看不見的邊相連。</p>
<p>每一次的相識與相離，都在這張巨大的網路圖中留下獨特的印記。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_graph/graph/">9.1 &nbsp; 圖</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_graph/graph_operations/">9.2 &nbsp; 圖基礎操作</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_graph/graph_traversal/">9.3 &nbsp; 圖的走訪</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_graph/summary/">9.4 &nbsp; 小結</a></li>
<li><a href="graph/">9.1 &nbsp; 圖</a></li>
<li><a href="graph_operations/">9.2 &nbsp; 圖基礎操作</a></li>
<li><a href="graph_traversal/">9.3 &nbsp; 圖的走訪</a></li>
<li><a href="summary/">9.4 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

16
zh-hant/chapter_greedy/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,13 +3538,13 @@
<p>向日葵朝著太陽轉動，時刻追求自身成長的最大可能。</p>
<p>貪婪策略在一輪輪的簡單選擇中，逐步導向最佳答案。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_greedy/greedy_algorithm/">15.1 &nbsp; 貪婪演算法</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_greedy/fractional_knapsack_problem/">15.2 &nbsp; 分數背包問題</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_greedy/max_capacity_problem/">15.3 &nbsp; 最大容量問題</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_greedy/max_product_cutting_problem/">15.4 &nbsp; 最大切分乘積問題</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_greedy/summary/">15.5 &nbsp; 小結</a></li>
<li><a href="greedy_algorithm/">15.1 &nbsp; 貪婪演算法</a></li>
<li><a href="fractional_knapsack_problem/">15.2 &nbsp; 分數背包問題</a></li>
<li><a href="max_capacity_problem/">15.3 &nbsp; 最大容量問題</a></li>
<li><a href="max_product_cutting_problem/">15.4 &nbsp; 最大切分乘積問題</a></li>
<li><a href="summary/">15.5 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

14
zh-hant/chapter_hashing/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,12 +3538,12 @@
<p>在計算機世界中，雜湊表如同一位聰慧的圖書管理員。</p>
<p>他知道如何計算索書號，從而可以快速找到目標圖書。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_hashing/hash_map/">6.1 &nbsp; 雜湊表</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_hashing/hash_collision/">6.2 &nbsp; 雜湊衝突</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_hashing/hash_algorithm/">6.3 &nbsp; 雜湊演算法</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_hashing/summary/">6.4 &nbsp; 小結</a></li>
<li><a href="hash_map/">6.1 &nbsp; 雜湊表</a></li>
<li><a href="hash_collision/">6.2 &nbsp; 雜湊衝突</a></li>
<li><a href="hash_algorithm/">6.3 &nbsp; 雜湊演算法</a></li>
<li><a href="summary/">6.4 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

14
zh-hant/chapter_heap/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,12 +3538,12 @@
<p>堆積就像是山嶽峰巒，層疊起伏、形態各異。</p>
<p>座座山峰高低錯落，而最高的山峰總是最先映入眼簾。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_heap/heap/">8.1 &nbsp; 堆積</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_heap/build_heap/">8.2 &nbsp; 建堆積操作</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_heap/top_k/">8.3 &nbsp; Top-k 問題</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_heap/summary/">8.4 &nbsp; 小結</a></li>
<li><a href="heap/">8.1 &nbsp; 堆積</a></li>
<li><a href="build_heap/">8.2 &nbsp; 建堆積操作</a></li>
<li><a href="top_k/">8.3 &nbsp; Top-k 問題</a></li>
<li><a href="summary/">8.4 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

12
zh-hant/chapter_introduction/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,11 +3538,11 @@
<p>一位少女翩翩起舞，與資料交織在一起，裙襬上飄揚著演算法的旋律。</p>
<p>她邀請你共舞，請緊跟她的步伐，踏入充滿邏輯與美感的演算法世界。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_introduction/algorithms_are_everywhere/">1.1 &nbsp; 演算法無處不在</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_introduction/what_is_dsa/">1.2 &nbsp; 演算法是什麼</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_introduction/summary/">1.3 &nbsp; 小結</a></li>
<li><a href="algorithms_are_everywhere/">1.1 &nbsp; 演算法無處不在</a></li>
<li><a href="what_is_dsa/">1.2 &nbsp; 演算法是什麼</a></li>
<li><a href="summary/">1.3 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

12
zh-hant/chapter_preface/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,11 +3538,11 @@
<p>演算法猶如美妙的交響樂，每一行程式碼都像韻律般流淌。</p>
<p>願這本書在你的腦海中輕輕響起，留下獨特而深刻的旋律。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_preface/about_the_book/">0.1 &nbsp; 關於本書</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_preface/suggestions/">0.2 &nbsp; 如何使用本書</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_preface/summary/">0.3 &nbsp; 小結</a></li>
<li><a href="about_the_book/">0.1 &nbsp; 關於本書</a></li>
<li><a href="suggestions/">0.2 &nbsp; 如何使用本書</a></li>
<li><a href="summary/">0.3 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

18
zh-hant/chapter_searching/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,14 +3538,14 @@
<p>搜尋是一場未知的冒險，我們或許需要走遍神秘空間的每個角落，又或許可以快速鎖定目標。</p>
<p>在這場尋覓之旅中，每一次探索都可能得到一個未曾料想的答案。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_searching/binary_search/">10.1 &nbsp; 二分搜尋</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_searching/binary_search_insertion/">10.2 &nbsp; 二分搜尋插入點</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_searching/binary_search_edge/">10.3 &nbsp; 二分搜尋邊界</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_searching/replace_linear_by_hashing/">10.4 &nbsp; 雜湊最佳化策略</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_searching/searching_algorithm_revisited/">10.5 &nbsp; 重識搜尋演算法</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_searching/summary/">10.6 &nbsp; 小結</a></li>
<li><a href="binary_search/">10.1 &nbsp; 二分搜尋</a></li>
<li><a href="binary_search_insertion/">10.2 &nbsp; 二分搜尋插入點</a></li>
<li><a href="binary_search_edge/">10.3 &nbsp; 二分搜尋邊界</a></li>
<li><a href="replace_linear_by_hashing/">10.4 &nbsp; 雜湊最佳化策略</a></li>
<li><a href="searching_algorithm_revisited/">10.5 &nbsp; 重識搜尋演算法</a></li>
<li><a href="summary/">10.6 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

28
zh-hant/chapter_sorting/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,19 +3538,19 @@
<p>排序猶如一把將混亂變為秩序的魔法鑰匙，使我們能以更高效的方式理解與處理資料。</p>
<p>無論是簡單的升序，還是複雜的分類排列，排序都向我們展示了資料的和諧美感。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_sorting/sorting_algorithm/">11.1 &nbsp; 排序演算法</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_sorting/selection_sort/">11.2 &nbsp; 選擇排序</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_sorting/bubble_sort/">11.3 &nbsp; 泡沫排序</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_sorting/insertion_sort/">11.4 &nbsp; 插入排序</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_sorting/quick_sort/">11.5 &nbsp; 快速排序</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_sorting/merge_sort/">11.6 &nbsp; 合併排序</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_sorting/heap_sort/">11.7 &nbsp; 堆積排序</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_sorting/bucket_sort/">11.8 &nbsp; 桶排序</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_sorting/counting_sort/">11.9 &nbsp; 計數排序</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_sorting/radix_sort/">11.10 &nbsp; 基數排序</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_sorting/summary/">11.11 &nbsp; 小結</a></li>
<li><a href="sorting_algorithm/">11.1 &nbsp; 排序演算法</a></li>
<li><a href="selection_sort/">11.2 &nbsp; 選擇排序</a></li>
<li><a href="bubble_sort/">11.3 &nbsp; 泡沫排序</a></li>
<li><a href="insertion_sort/">11.4 &nbsp; 插入排序</a></li>
<li><a href="quick_sort/">11.5 &nbsp; 快速排序</a></li>
<li><a href="merge_sort/">11.6 &nbsp; 合併排序</a></li>
<li><a href="heap_sort/">11.7 &nbsp; 堆積排序</a></li>
<li><a href="bucket_sort/">11.8 &nbsp; 桶排序</a></li>
<li><a href="counting_sort/">11.9 &nbsp; 計數排序</a></li>
<li><a href="radix_sort/">11.10 &nbsp; 基數排序</a></li>
<li><a href="summary/">11.11 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

14
zh-hant/chapter_stack_and_queue/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,12 +3538,12 @@
<p>堆疊如同疊貓貓，而佇列就像貓貓排隊。</p>
<p>兩者分別代表先入後出和先入先出的邏輯關係。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_stack_and_queue/stack/">5.1 &nbsp; 堆疊</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_stack_and_queue/queue/">5.2 &nbsp; 佇列</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_stack_and_queue/deque/">5.3 &nbsp; 雙向佇列</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_stack_and_queue/summary/">5.4 &nbsp; 小結</a></li>
<li><a href="stack/">5.1 &nbsp; 堆疊</a></li>
<li><a href="queue/">5.2 &nbsp; 佇列</a></li>
<li><a href="deque/">5.3 &nbsp; 雙向佇列</a></li>
<li><a href="summary/">5.4 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

18
zh-hant/chapter_tree/index.html
View file

@ -3487,9 +3487,9 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#chapter-contents" class="md-nav__link">
<a href="#_1" class="md-nav__link">
<span class="md-ellipsis">
Chapter Contents
本章內容
</span>
</a>
@ -3538,14 +3538,14 @@
<p>參天大樹充滿生命力，根深葉茂，分枝扶疏。</p>
<p>它為我們展現了資料分治的生動形態。</p>
</div>
<h2 id="chapter-contents">Chapter Contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<h2 id="_1">本章內容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/en/chapter_tree/binary_tree/">7.1 &nbsp; 二元樹</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_tree/binary_tree_traversal/">7.2 &nbsp; 二元樹走訪</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_tree/array_representation_of_tree/">7.3 &nbsp; 二元樹陣列表示</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_tree/binary_search_tree/">7.4 &nbsp; 二元搜尋樹</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_tree/avl_tree/">7.5 &nbsp; AVL *</a></li>
<li><a href="https://www.hello-algo.com/en/chapter_tree/summary/">7.6 &nbsp; 小結</a></li>
<li><a href="binary_tree/">7.1 &nbsp; 二元樹</a></li>
<li><a href="binary_tree_traversal/">7.2 &nbsp; 二元樹走訪</a></li>
<li><a href="array_representation_of_tree/">7.3 &nbsp; 二元樹陣列表示</a></li>
<li><a href="binary_search_tree/">7.4 &nbsp; 二元搜尋樹</a></li>
<li><a href="avl_tree/">7.5 &nbsp; AVL *</a></li>
<li><a href="summary/">7.6 &nbsp; 小結</a></li>
</ul>
<!-- Source file information -->

4
zh-hant/index.html
View file

@ -330,7 +330,7 @@
<img alt="Cover" class="device-on-hover" src="../assets/hero/cover_render.png" style="height: 66.83%;"/>
<div class="text-button">
<span>
紙質書（簡體中文版）
紙質書（簡中）
</span>
<svg viewbox="0 0 320 512" xmlns="http://www.w3.org/2000/svg">
<path d="M278.6 233.4c12.5 12.5 12.5 32.8 0 45.3l-160 160c-12.5 12.5-32.8 12.5-45.3 0s-12.5-32.8 0-45.3L210.7 256 73.4 118.6c-12.5-12.5-12.5-32.8 0-45.3s32.8-12.5 45.3 0l160 160z">
@ -362,7 +362,7 @@
<img alt="" class="device-on-hover" src="../assets/hero/pdf_ipad.png" style="height: 75%;"/>
<div class="text-button">
<span>
下載 PDF
PDF（簡中）
</span>
<svg viewbox="0 0 320 512" xmlns="http://www.w3.org/2000/svg">
<path d="M278.6 233.4c12.5 12.5 12.5 32.8 0 45.3l-160 160c-12.5 12.5-32.8 12.5-45.3 0s-12.5-32.8 0-45.3L210.7 256 73.4 118.6c-12.5-12.5-12.5-32.8 0-45.3s32.8-12.5 45.3 0l160 160z">

2
zh-hant/search/search_index.json
View file

File diff suppressed because one or more lines are too long

210
zh-hant/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/zh-hant/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_appendix/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_appendix/contribution/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_appendix/installation/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_appendix/terminology/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_array_and_linkedlist/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_array_and_linkedlist/array/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_array_and_linkedlist/linked_list/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_array_and_linkedlist/list/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_array_and_linkedlist/ram_and_cache/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_array_and_linkedlist/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_backtracking/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_backtracking/backtracking_algorithm/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_backtracking/n_queens_problem/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_backtracking/permutations_problem/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_backtracking/subset_sum_problem/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_backtracking/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_computational_complexity/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_computational_complexity/iteration_and_recursion/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_computational_complexity/performance_evaluation/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_computational_complexity/space_complexity/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_computational_complexity/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_computational_complexity/time_complexity/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_data_structure/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_data_structure/basic_data_types/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_data_structure/character_encoding/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_data_structure/classification_of_data_structure/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_data_structure/number_encoding/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_data_structure/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_divide_and_conquer/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_divide_and_conquer/binary_search_recur/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_divide_and_conquer/build_binary_tree_problem/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_divide_and_conquer/divide_and_conquer/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_divide_and_conquer/hanota_problem/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_divide_and_conquer/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_dynamic_programming/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_dynamic_programming/dp_problem_features/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_dynamic_programming/dp_solution_pipeline/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_dynamic_programming/edit_distance_problem/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_dynamic_programming/intro_to_dynamic_programming/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_dynamic_programming/knapsack_problem/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_dynamic_programming/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_dynamic_programming/unbounded_knapsack_problem/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_graph/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_graph/graph/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_graph/graph_operations/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_graph/graph_traversal/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_graph/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_greedy/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_greedy/fractional_knapsack_problem/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_greedy/greedy_algorithm/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_greedy/max_capacity_problem/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_greedy/max_product_cutting_problem/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_greedy/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_hashing/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_hashing/hash_algorithm/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_hashing/hash_collision/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_hashing/hash_map/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_hashing/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_heap/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_heap/build_heap/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_heap/heap/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_heap/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_heap/top_k/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_hello_algo/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_introduction/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_introduction/algorithms_are_everywhere/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_introduction/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_introduction/what_is_dsa/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_preface/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_preface/about_the_book/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_preface/suggestions/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_preface/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_reference/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_searching/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_searching/binary_search/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_searching/binary_search_edge/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_searching/binary_search_insertion/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_searching/replace_linear_by_hashing/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_searching/searching_algorithm_revisited/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_searching/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_sorting/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_sorting/bubble_sort/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_sorting/bucket_sort/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_sorting/counting_sort/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_sorting/heap_sort/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_sorting/insertion_sort/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_sorting/merge_sort/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_sorting/quick_sort/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_sorting/radix_sort/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_sorting/selection_sort/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_sorting/sorting_algorithm/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_sorting/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_stack_and_queue/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_stack_and_queue/deque/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_stack_and_queue/queue/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_stack_and_queue/stack/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_stack_and_queue/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_tree/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_tree/array_representation_of_tree/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_tree/avl_tree/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_tree/binary_search_tree/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_tree/binary_tree/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_tree/binary_tree_traversal/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/zh-hant/chapter_tree/summary/</loc>
<lastmod>2024-04-05</lastmod>
<lastmod>2024-04-06</lastmod>
<changefreq>daily</changefreq>
</url>
</urlset>

BIN
zh-hant/sitemap.xml.gz
View file

Binary file not shown.