algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-28 21:02:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-02-19 01:40:08 +08:00
parent 8a7c5978c8
commit 6bd1f46936
49 changed files with 3495 additions and 3495 deletions
Download Patch File Download Diff File Expand all files Collapse all files

150
chapter_data_structure/data_and_memory/index.html
View File

@ -25,7 +25,7 @@
<title>数据与内存 - Hello 算法</title>
<title>3.1. 数据与内存 - Hello 算法</title>
@ -111,7 +111,7 @@
<div class="md-header__topic" data-md-component="header-topic">
<span class="md-ellipsis">
数据与内存
3.1. 数据与内存
</span>
</div>
@ -268,14 +268,14 @@
<label class="md-nav__link" for="__nav_1" id="__nav_1_label" tabindex="0">
写在前面
0. 写在前面
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_1_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_1">
<span class="md-nav__icon md-icon"></span>
写在前面
0. 写在前面
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -286,7 +286,7 @@
<li class="md-nav__item">
<a href="../../chapter_preface/about_the_book/" class="md-nav__link">
关于本书
0.1. 关于本书
</a>
</li>
@ -300,7 +300,7 @@
<li class="md-nav__item">
<a href="../../chapter_preface/suggestions/" class="md-nav__link">
如何使用本书
0.2. 如何使用本书
</a>
</li>
@ -314,7 +314,7 @@
<li class="md-nav__item">
<a href="../../chapter_preface/installation/" class="md-nav__link">
编程环境安装
0.3. 编程环境安装
</a>
</li>
@ -328,7 +328,7 @@
<li class="md-nav__item">
<a href="../../chapter_preface/contribution/" class="md-nav__link">
一起参与创作
0.4. 一起参与创作
</a>
</li>
@ -367,14 +367,14 @@
<label class="md-nav__link" for="__nav_2" id="__nav_2_label" tabindex="0">
引言
1. 引言
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_2_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_2">
<span class="md-nav__icon md-icon"></span>
引言
1. 引言
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -385,7 +385,7 @@
<li class="md-nav__item">
<a href="../../chapter_introduction/algorithms_are_everywhere/" class="md-nav__link">
算法无处不在
1.1. 算法无处不在
</a>
</li>
@ -399,7 +399,7 @@
<li class="md-nav__item">
<a href="../../chapter_introduction/what_is_dsa/" class="md-nav__link">
算法是什么
1.2. 算法是什么
</a>
</li>
@ -444,14 +444,14 @@
<label class="md-nav__link" for="__nav_3" id="__nav_3_label" tabindex="0">
计算复杂度
2. 计算复杂度
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_3_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_3">
<span class="md-nav__icon md-icon"></span>
计算复杂度
2. 计算复杂度
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -462,7 +462,7 @@
<li class="md-nav__item">
<a href="../../chapter_computational_complexity/performance_evaluation/" class="md-nav__link">
算法效率评估
2.1. 算法效率评估
</a>
</li>
@ -476,7 +476,7 @@
<li class="md-nav__item">
<a href="../../chapter_computational_complexity/time_complexity/" class="md-nav__link">
时间复杂度
2.2. 时间复杂度
</a>
</li>
@ -490,7 +490,7 @@
<li class="md-nav__item">
<a href="../../chapter_computational_complexity/space_complexity/" class="md-nav__link">
空间复杂度
2.3. 空间复杂度
</a>
</li>
@ -504,7 +504,7 @@
<li class="md-nav__item">
<a href="../../chapter_computational_complexity/space_time_tradeoff/" class="md-nav__link">
权衡时间与空间
2.4. 权衡时间与空间
</a>
</li>
@ -518,7 +518,7 @@
<li class="md-nav__item">
<a href="../../chapter_computational_complexity/summary/" class="md-nav__link">
小结
2.5. 小结
</a>
</li>
@ -561,14 +561,14 @@
<label class="md-nav__link" for="__nav_4" id="__nav_4_label" tabindex="0">
数据结构简介
3. 数据结构简介
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_4_label" aria-expanded="true">
<label class="md-nav__title" for="__nav_4">
<span class="md-nav__icon md-icon"></span>
数据结构简介
3. 数据结构简介
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -588,12 +588,12 @@
<label class="md-nav__link md-nav__link--active" for="__toc">
数据与内存
3.1. 数据与内存
<span class="md-nav__icon md-icon"></span>
</label>
<a href="./" class="md-nav__link md-nav__link--active">
数据与内存
3.1. 数据与内存
</a>
@ -641,7 +641,7 @@
<li class="md-nav__item">
<a href="../classification_of_data_structure/" class="md-nav__link">
数据结构分类
3.2. 数据结构分类
</a>
</li>
@ -655,7 +655,7 @@
<li class="md-nav__item">
<a href="../summary/" class="md-nav__link">
小结
3.3. 小结
</a>
</li>
@ -698,14 +698,14 @@
<label class="md-nav__link" for="__nav_5" id="__nav_5_label" tabindex="0">
数组与链表
4. 数组与链表
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_5_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_5">
<span class="md-nav__icon md-icon"></span>
数组与链表
4. 数组与链表
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -716,7 +716,7 @@
<li class="md-nav__item">
<a href="../../chapter_array_and_linkedlist/array/" class="md-nav__link">
数组（Array）
4.1. 数组（Array）
</a>
</li>
@ -730,7 +730,7 @@
<li class="md-nav__item">
<a href="../../chapter_array_and_linkedlist/linked_list/" class="md-nav__link">
链表（LinkedList）
4.2. 链表（LinkedList）
</a>
</li>
@ -744,7 +744,7 @@
<li class="md-nav__item">
<a href="../../chapter_array_and_linkedlist/list/" class="md-nav__link">
列表（List）
4.3. 列表（List）
</a>
</li>
@ -758,7 +758,7 @@
<li class="md-nav__item">
<a href="../../chapter_array_and_linkedlist/summary/" class="md-nav__link">
小结
4.4. 小结
</a>
</li>
@ -801,14 +801,14 @@
<label class="md-nav__link" for="__nav_6" id="__nav_6_label" tabindex="0">
栈与队列
5. 栈与队列
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_6_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_6">
<span class="md-nav__icon md-icon"></span>
栈与队列
5. 栈与队列
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -819,7 +819,7 @@
<li class="md-nav__item">
<a href="../../chapter_stack_and_queue/stack/" class="md-nav__link">
栈（Stack）
5.1. 栈（Stack）
</a>
</li>
@ -833,7 +833,7 @@
<li class="md-nav__item">
<a href="../../chapter_stack_and_queue/queue/" class="md-nav__link">
队列（Queue）
5.2. 队列（Queue）
</a>
</li>
@ -847,7 +847,7 @@
<li class="md-nav__item">
<a href="../../chapter_stack_and_queue/deque/" class="md-nav__link">
双向队列（Deque）
5.3. 双向队列（Deque）
</a>
</li>
@ -861,7 +861,7 @@
<li class="md-nav__item">
<a href="../../chapter_stack_and_queue/summary/" class="md-nav__link">
小结
5.4. 小结
</a>
</li>
@ -902,14 +902,14 @@
<label class="md-nav__link" for="__nav_7" id="__nav_7_label" tabindex="0">
散列表
6. 散列表
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_7_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_7">
<span class="md-nav__icon md-icon"></span>
散列表
6. 散列表
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -920,7 +920,7 @@
<li class="md-nav__item">
<a href="../../chapter_hashing/hash_map/" class="md-nav__link">
哈希表（HashMap）
6.1. 哈希表（HashMap）
</a>
</li>
@ -934,7 +934,7 @@
<li class="md-nav__item">
<a href="../../chapter_hashing/hash_collision/" class="md-nav__link">
哈希冲突处理
6.2. 哈希冲突处理
</a>
</li>
@ -948,7 +948,7 @@
<li class="md-nav__item">
<a href="../../chapter_hashing/summary/" class="md-nav__link">
小结
6.3. 小结
</a>
</li>
@ -993,14 +993,14 @@
<label class="md-nav__link" for="__nav_8" id="__nav_8_label" tabindex="0">
二叉树
7. 二叉树
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_8_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_8">
<span class="md-nav__icon md-icon"></span>
二叉树
7. 二叉树
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -1011,7 +1011,7 @@
<li class="md-nav__item">
<a href="../../chapter_tree/binary_tree/" class="md-nav__link">
二叉树（Binary Tree）
7.1. 二叉树（Binary Tree）
</a>
</li>
@ -1025,7 +1025,7 @@
<li class="md-nav__item">
<a href="../../chapter_tree/binary_tree_traversal/" class="md-nav__link">
二叉树遍历
7.2. 二叉树遍历
</a>
</li>
@ -1039,7 +1039,7 @@
<li class="md-nav__item">
<a href="../../chapter_tree/binary_search_tree/" class="md-nav__link">
二叉搜索树
7.3. 二叉搜索树
</a>
</li>
@ -1053,7 +1053,7 @@
<li class="md-nav__item">
<a href="../../chapter_tree/avl_tree/" class="md-nav__link">
AVL 树 *
7.4. AVL 树 *
</a>
</li>
@ -1067,7 +1067,7 @@
<li class="md-nav__item">
<a href="../../chapter_tree/summary/" class="md-nav__link">
小结
7.5. 小结
</a>
</li>
@ -1104,14 +1104,14 @@
<label class="md-nav__link" for="__nav_9" id="__nav_9_label" tabindex="0">
堆
8. 堆
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_9_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_9">
<span class="md-nav__icon md-icon"></span>
堆
8. 堆
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -1122,7 +1122,7 @@
<li class="md-nav__item">
<a href="../../chapter_heap/heap/" class="md-nav__link">
堆（Heap）
8.1. 堆（Heap）
</a>
</li>
@ -1163,14 +1163,14 @@
<label class="md-nav__link" for="__nav_10" id="__nav_10_label" tabindex="0">
图
9. 图
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_10_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_10">
<span class="md-nav__icon md-icon"></span>
图
9. 图
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -1181,7 +1181,7 @@
<li class="md-nav__item">
<a href="../../chapter_graph/graph/" class="md-nav__link">
图（Graph）
9.1. 图（Graph）
</a>
</li>
@ -1195,7 +1195,7 @@
<li class="md-nav__item">
<a href="../../chapter_graph/graph_operations/" class="md-nav__link">
图基础操作
9.2. 图基础操作
</a>
</li>
@ -1209,7 +1209,7 @@
<li class="md-nav__item">
<a href="../../chapter_graph/graph_traversal/" class="md-nav__link">
图的遍历
9.3. 图的遍历
</a>
</li>
@ -1252,14 +1252,14 @@
<label class="md-nav__link" for="__nav_11" id="__nav_11_label" tabindex="0">
查找算法
10. 查找算法
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_11_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_11">
<span class="md-nav__icon md-icon"></span>
查找算法
10. 查找算法
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -1270,7 +1270,7 @@
<li class="md-nav__item">
<a href="../../chapter_searching/linear_search/" class="md-nav__link">
线性查找
10.1. 线性查找
</a>
</li>
@ -1284,7 +1284,7 @@
<li class="md-nav__item">
<a href="../../chapter_searching/binary_search/" class="md-nav__link">
二分查找
10.2. 二分查找
</a>
</li>
@ -1298,7 +1298,7 @@
<li class="md-nav__item">
<a href="../../chapter_searching/hashing_search/" class="md-nav__link">
哈希查找
10.3. 哈希查找
</a>
</li>
@ -1312,7 +1312,7 @@
<li class="md-nav__item">
<a href="../../chapter_searching/summary/" class="md-nav__link">
小结
10.4. 小结
</a>
</li>
@ -1359,14 +1359,14 @@
<label class="md-nav__link" for="__nav_12" id="__nav_12_label" tabindex="0">
排序算法
11. 排序算法
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_12_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_12">
<span class="md-nav__icon md-icon"></span>
排序算法
11. 排序算法
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -1377,7 +1377,7 @@
<li class="md-nav__item">
<a href="../../chapter_sorting/intro_to_sort/" class="md-nav__link">
排序简介
11.1. 排序简介
</a>
</li>
@ -1391,7 +1391,7 @@
<li class="md-nav__item">
<a href="../../chapter_sorting/bubble_sort/" class="md-nav__link">
冒泡排序
11.2. 冒泡排序
</a>
</li>
@ -1405,7 +1405,7 @@
<li class="md-nav__item">
<a href="../../chapter_sorting/insertion_sort/" class="md-nav__link">
插入排序
11.3. 插入排序
</a>
</li>
@ -1419,7 +1419,7 @@
<li class="md-nav__item">
<a href="../../chapter_sorting/quick_sort/" class="md-nav__link">
快速排序
11.4. 快速排序
</a>
</li>
@ -1433,7 +1433,7 @@
<li class="md-nav__item">
<a href="../../chapter_sorting/merge_sort/" class="md-nav__link">
归并排序
11.5. 归并排序
</a>
</li>
@ -1447,7 +1447,7 @@
<li class="md-nav__item">
<a href="../../chapter_sorting/summary/" class="md-nav__link">
小结
11.6. 小结
</a>
</li>
@ -1822,7 +1822,7 @@
<nav class="md-footer__inner md-grid" aria-label="页脚" >
<a href="../../chapter_computational_complexity/summary/" class="md-footer__link md-footer__link--prev" aria-label="上一页: 小结" rel="prev">
<a href="../../chapter_computational_complexity/summary/" class="md-footer__link md-footer__link--prev" aria-label="上一页: 2.5. 小结" rel="prev">
<div class="md-footer__button md-icon">
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M20 11v2H8l5.5 5.5-1.42 1.42L4.16 12l7.92-7.92L13.5 5.5 8 11h12Z"/></svg>
</div>
@ -1831,20 +1831,20 @@
<span class="md-footer__direction">
上一页
</span>
小结
2.5. 小结
</div>
</div>
</a>
<a href="../classification_of_data_structure/" class="md-footer__link md-footer__link--next" aria-label="下一页: 数据结构分类" rel="next">
<a href="../classification_of_data_structure/" class="md-footer__link md-footer__link--next" aria-label="下一页: 3.2. 数据结构分类" rel="next">
<div class="md-footer__title">
<div class="md-ellipsis">
<span class="md-footer__direction">
下一页
</span>
数据结构分类
3.2. 数据结构分类
</div>
</div>
<div class="md-footer__button md-icon">