xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-22 19:36:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2026-04-02 03:08:50 +08:00
parent 09a136c9fa
commit aaf9f58eb3
157 changed files with 3002 additions and 2994 deletions
Download Patch File Download Diff File Expand all files Collapse all files
en/chapter_array_and_linkedlist/index.html
+27 -27
View File
@@ -6,7 +6,7 @@
<meta charset="utf-8">
<meta name="viewport" content="width=device-width,initial-scale=1">
<meta name="description" content="Data Structures and Algorithms Crash Course with Animated Illustrations and Off-the-Shelf Code">
<meta name="description" content="Data structures and algorithms tutorial with animated illustrations and ready-to-run code">
<meta name="author" content="krahets">
@@ -39,7 +39,7 @@
<title>Chapter 4. Array and Linked List - Hello Algo</title>
<title>Chapter 4. Arrays and Linked Lists - Hello Algo</title>
@@ -99,7 +99,7 @@
<div data-md-component="skip">
<a href="#chapter-4-array-and-linked-list" class="md-skip">
<a href="#chapter-4-arrays-and-linked-lists" class="md-skip">
Skip to content
</a>
@@ -154,7 +154,7 @@
<div class="md-header__topic" data-md-component="header-topic">
<span class="md-ellipsis">
Chapter 4. &nbsp; Array and Linked List
Chapter 4. &nbsp; Arrays and Linked Lists
</span>
</div>
@@ -576,7 +576,7 @@
<span class="md-ellipsis">
Chapter 1. Encounter With Algorithms
Chapter 1. Encounter with Algorithms
@@ -598,7 +598,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 1. Encounter With Algorithms
Chapter 1. Encounter with Algorithms
</label>
@@ -1185,7 +1185,7 @@
<span class="md-ellipsis">
Chapter 4. Array and Linked List
Chapter 4. Arrays and Linked Lists
@@ -1207,7 +1207,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 4. Array and Linked List
Chapter 4. Arrays and Linked Lists
</label>
@@ -1313,7 +1313,7 @@
<span class="md-ellipsis">
4.4 Memory and Cache *
4.4 Random-Access Memory and Cache *
@@ -1404,7 +1404,7 @@
<span class="md-ellipsis">
Chapter 5. Stack and Queue
Chapter 5. Stacks and Queues
@@ -1426,7 +1426,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 5. Stack and Queue
Chapter 5. Stacks and Queues
</label>
@@ -1504,7 +1504,7 @@
<span class="md-ellipsis">
5.3 Double-Ended Queue
5.3 Deque
@@ -1595,7 +1595,7 @@
<span class="md-ellipsis">
Chapter 6. Hashing
Chapter 6. Hash Table
@@ -1617,7 +1617,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 6. Hashing
Chapter 6. Hash Table
</label>
@@ -1890,7 +1890,7 @@
<span class="md-ellipsis">
7.3 Array Representation of Tree
7.3 Array Representation of Binary Trees
@@ -2109,7 +2109,7 @@
<span class="md-ellipsis">
8.2 Building a Heap
8.2 Heap Construction Operation
@@ -2137,7 +2137,7 @@
<span class="md-ellipsis">
8.3 Top-K Problem
8.3 Top-k Problem
@@ -2495,7 +2495,7 @@
<span class="md-ellipsis">
10.2 Binary Search Insertion
10.2 Binary Search Insertion Point
@@ -2523,7 +2523,7 @@
<span class="md-ellipsis">
10.3 Binary Search Edge Cases
10.3 Binary Search Boundaries
@@ -2579,7 +2579,7 @@
<span class="md-ellipsis">
10.5 Search Algorithms Revisited
10.5 Searching Algorithms Revisited
@@ -2728,7 +2728,7 @@
<span class="md-ellipsis">
11.1 Sorting Algorithms
11.1 Sorting Algorithm
@@ -3201,7 +3201,7 @@
<span class="md-ellipsis">
12.4 Hanoi Tower Problem
12.4 Hanota Problem
@@ -4113,7 +4113,7 @@
<span class="md-ellipsis">
16.3 Terminology Table
16.3 Glossary
@@ -4275,19 +4275,19 @@
<!-- Page content -->
<h1 id="chapter-4-array-and-linked-list">Chapter 4. &nbsp; Array and Linked List<a class="headerlink" href="#chapter-4-array-and-linked-list" title="Permanent link">&para;</a></h1>
<p><img alt="Array and Linked List" class="cover-image" src="../assets/covers/chapter_array_and_linkedlist.jpg" /></p>
<h1 id="chapter-4-arrays-and-linked-lists">Chapter 4. &nbsp; Arrays and Linked Lists<a class="headerlink" href="#chapter-4-arrays-and-linked-lists" title="Permanent link">&para;</a></h1>
<p><img alt="Arrays and Linked Lists" class="cover-image" src="../assets/covers/chapter_array_and_linkedlist.jpg" /></p>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>The world of data structures is like a solid brick wall.</p>
<p>Array bricks are neatly arranged, tightly packed one by one. Linked list bricks are scattered everywhere, with connecting vines freely weaving through the gaps between bricks.</p>
<p>The bricks of an array are neatly aligned, each pressed tightly against the next. The bricks of a linked list are scattered about, with connecting vines weaving freely through the gaps between them.</p>
</div>
<h2 id="chapter-contents">Chapter contents<a class="headerlink" href="#chapter-contents" title="Permanent link">&para;</a></h2>
<ul>
<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="ram_and_cache/">4.4 &nbsp; Random-Access Memory and Cache *</a></li>
<li><a href="summary/">4.5 &nbsp; Summary</a></li>
</ul>