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

build

Browse source
This commit is contained in:
krahets 2024-01-15 01:12:04 +08:00
parent e1de22610f
commit cee5072127
4 changed files with 12 additions and 18 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
docs-en/chapter_array_and_linkedlist/summary.md
View file

@ -6,9 +6,9 @@ comments: true
### 1.   Key Review
- Arrays and linked lists are two fundamental data structures, representing two storage methods in computer memory: continuous space storage and dispersed space storage. Their characteristics complement each other.
- Arrays and linked lists are two basic data structures, representing two storage methods in computer memory: contiguous space storage and non-contiguous space storage. Their characteristics complement each other.
- Arrays support random access and use less memory; however, they are inefficient in inserting and deleting elements and have a fixed length after initialization.
- Linked lists implement efficient node insertion and deletion through changing references (pointers) and can flexibly adjust their length; however, they have lower node access efficiency and use more memory.
- Linked lists implement efficient node insertion and deletion through changing references (pointers) and can flexibly adjust their length; however, they have lower node access efficiency and consume more memory.
- Common types of linked lists include singly linked lists, circular linked lists, and doubly linked lists, each with its own application scenarios.
- Lists are ordered collections of elements that support addition, deletion, and modification, typically implemented based on dynamic arrays, retaining the advantages of arrays while allowing flexible length adjustment.
- The advent of lists significantly enhanced the practicality of arrays but may lead to some memory space wastage.
@ -20,7 +20,7 @@ comments: true
**Q**: Does storing arrays on the stack versus the heap affect time and space efficiency?
Arrays stored on both the stack and heap are stored in continuous memory spaces, and data operation efficiency is essentially the same. However, stacks and heaps have their own characteristics, leading to the following differences.
Arrays stored on both the stack and heap are stored in contiguous memory spaces, and data operation efficiency is essentially the same. However, stacks and heaps have their own characteristics, leading to the following differences.
1. Allocation and release efficiency: The stack is a smaller memory block, allocated automatically by the compiler; the heap memory is relatively larger and can be dynamically allocated in the code, more prone to fragmentation. Therefore, allocation and release operations on the heap are generally slower than on the stack.
2. Size limitation: Stack memory is relatively small, while the heap size is generally limited by available memory. Therefore, the heap is more suitable for storing large arrays.

11
docs-en/index.md
View file

@ -7,12 +7,11 @@ hide:
- edit
---
<div class="header-img-div" style="max-width: 500px;">
<img src="index.assets/conceptual_rendering.png" style="width: 37%; height: auto;">
<img src="index.assets/hello_algo_mindmap_tp.png" style="width: 63%; height: auto;">
<div class="header-img-div" style="max-width: 600px;">
<img src="index.assets/hello_algo_header.png" style="width: 100%; height: auto; margin-left: 15px; margin-right: 15px;">
</div>
<h2 align="center">Hello Algo</h2>
<h2 align="center" style="margin-top: 25px;">Hello Algo</h2>
<p align="center">Data Structures and Algorithms Crash Course with Animated Illustrations and Off-the-Shelf Code</p>
@ -66,9 +65,7 @@ hide:
<p>Feel free to engage in Chinese-to-English translation and pull request review! For guidelines, please see <a href="https://github.com/krahets/hello-algo/issues/914">#914</a>.</p>
</div>
---
<h3 align="center">Endorsements</h3>
<img src="index.assets/hello_algo_hero.jpg" class="cover-image" style="width: 100%;">
<div style="display: flex;">
<div class="admonition quote" style="flex: 1; margin-right: 0.4rem;">

11
docs/index.md
View file

@ -7,12 +7,11 @@ hide:
- edit
---
<div class="header-img-div" style="max-width: 500px;">
<img src="index.assets/conceptual_rendering.png" style="width: 37%; height: auto; margin-left: 15px; margin-right: 15px;">
<img src="index.assets/hello_algo_mindmap_tp.png" style="width: 63%; height: auto; margin-left: 15px; margin-right: 15px;">
<div class="header-img-div" style="max-width: 600px;">
<img src="index.assets/hello_algo_header.png" style="width: 100%; height: auto; margin-left: 15px; margin-right: 15px;">
</div>
<h2 align="center">《 Hello 算法 》</h2>
<h2 align="center" style="margin-top: 25px;">《 Hello 算法 》</h2>
<p align="center">动画图解、一键运行的数据结构与算法教程</p>
@ -61,9 +60,7 @@ hide:
<img src="https://img.shields.io/badge/Stay%20Tuned-snow">
</p>
---
<h3 align="center">推荐语</h3>
<img src="index.assets/hello_algo_hero.jpg" class="cover-image" style="width: 100%;">
<div style="display: flex;">
<div class="admonition quote" style="flex: 1; margin-right: 0.4rem;">

2
overrides/stylesheets/extra.css
View file

@ -68,9 +68,9 @@
width: 28rem;
height: auto;
border-radius: 0.3rem;
box-shadow: var(--md-shadow-z2);
display: block;
margin: 0 auto;
box-shadow: var(--md-shadow-z2);
}
/* Center Markdown Tables (requires md_in_html extension) */