xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-24 20:16: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_appendix/contribution/index.html
+25 -25
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">
@@ -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>
@@ -1183,7 +1183,7 @@
<span class="md-ellipsis">
Chapter 4. Array and Linked List
Chapter 4. Arrays and Linked Lists
@@ -1205,7 +1205,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 4. Array and Linked List
Chapter 4. Arrays and Linked Lists
</label>
@@ -1311,7 +1311,7 @@
<span class="md-ellipsis">
4.4 Memory and Cache *
4.4 Random-Access Memory and Cache *
@@ -1402,7 +1402,7 @@
<span class="md-ellipsis">
Chapter 5. Stack and Queue
Chapter 5. Stacks and Queues
@@ -1424,7 +1424,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 5. Stack and Queue
Chapter 5. Stacks and Queues
</label>
@@ -1502,7 +1502,7 @@
<span class="md-ellipsis">
5.3 Double-Ended Queue
5.3 Deque
@@ -1593,7 +1593,7 @@
<span class="md-ellipsis">
Chapter 6. Hashing
Chapter 6. Hash Table
@@ -1615,7 +1615,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 6. Hashing
Chapter 6. Hash Table
</label>
@@ -1888,7 +1888,7 @@
<span class="md-ellipsis">
7.3 Array Representation of Tree
7.3 Array Representation of Binary Trees
@@ -2107,7 +2107,7 @@
<span class="md-ellipsis">
8.2 Building a Heap
8.2 Heap Construction Operation
@@ -2135,7 +2135,7 @@
<span class="md-ellipsis">
8.3 Top-K Problem
8.3 Top-k Problem
@@ -2493,7 +2493,7 @@
<span class="md-ellipsis">
10.2 Binary Search Insertion
10.2 Binary Search Insertion Point
@@ -2521,7 +2521,7 @@
<span class="md-ellipsis">
10.3 Binary Search Edge Cases
10.3 Binary Search Boundaries
@@ -2577,7 +2577,7 @@
<span class="md-ellipsis">
10.5 Search Algorithms Revisited
10.5 Searching Algorithms Revisited
@@ -2726,7 +2726,7 @@
<span class="md-ellipsis">
11.1 Sorting Algorithms
11.1 Sorting Algorithm
@@ -3199,7 +3199,7 @@
<span class="md-ellipsis">
12.4 Hanoi Tower Problem
12.4 Hanota Problem
@@ -4194,7 +4194,7 @@
<span class="md-ellipsis">
16.3 Terminology Table
16.3 Glossary
@@ -4391,7 +4391,7 @@
<ol>
<li>Click the "edit icon". If you encounter a prompt asking you to "Fork this repository", please approve the operation.</li>
<li>Modify the content of the Markdown source file, verify the correctness of the content, and maintain consistent formatting as much as possible.</li>
<li>Fill in a description of your changes at the bottom of the page, then click the "Propose file change" button. After the page transitions, click the "Create pull request" button to submit your pull request.</li>
<li>Fill in a description of your changes at the bottom of the page, then click the "Propose file change" button. After the new page loads, click the "Create pull request" button to submit your pull request.</li>
</ol>
<p><img alt="Page edit button" class="animation-figure" src="../contribution.assets/edit_markdown.png" /></p>
<p align="center"> Figure 16-3 &nbsp; Page edit button </p>
@@ -4401,13 +4401,13 @@
<p>If you are interested in contributing to this open source project, including translating code into other programming languages or expanding article content, you will need to follow the Pull Request workflow below.</p>
<ol>
<li>Log in to GitHub and Fork the book's <a href="https://github.com/krahets/hello-algo">code repository</a> to your personal account.</li>
<li>Enter your forked repository webpage and use the <code>git clone</code> command to clone the repository to your local machine.</li>
<li>Go to your forked repository page and use the <code>git clone</code> command to clone the repository to your local machine.</li>
<li>Create content locally and conduct comprehensive tests to verify code correctness.</li>
<li>Commit your local changes and push them to the remote repository.</li>
<li>Refresh the repository webpage and click the "Create pull request" button to submit your pull request.</li>
</ol>
<h3 id="3-docker-deployment">3. &nbsp; Docker Deployment<a class="headerlink" href="#3-docker-deployment" title="Permanent link">&para;</a></h3>
<p>From the root directory of <code>hello-algo</code>, run the following Docker script to access the project at <code>http://localhost:8000</code>:</p>
<p>From the root directory of <code>hello-algo</code>, run the following Docker command to access the project at <code>http://localhost:8000</code>:</p>
<div class="highlight"><pre><span></span><code><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a>docker-compose<span class="w"> </span>up<span class="w"> </span>-d
</code></pre></div>
<p>Use the following command to remove the deployment:</p>
@@ -4459,7 +4459,7 @@ aria-label="Footer"
<a
href="../terminology/"
class="md-footer__link md-footer__link--next"
aria-label="Next: 16.3 Terminology Table"
aria-label="Next: 16.3 Glossary"
rel="next"
>
<div class="md-footer__title">
@@ -4467,7 +4467,7 @@ aria-label="Footer"
Next
</span>
<div class="md-ellipsis">
16.3 Terminology Table
16.3 Glossary
</div>
</div>
<div class="md-footer__button md-icon">
en/chapter_appendix/index.html
+21 -21
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">
@@ -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>
@@ -1183,7 +1183,7 @@
<span class="md-ellipsis">
Chapter 4. Array and Linked List
Chapter 4. Arrays and Linked Lists
@@ -1205,7 +1205,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 4. Array and Linked List
Chapter 4. Arrays and Linked Lists
</label>
@@ -1311,7 +1311,7 @@
<span class="md-ellipsis">
4.4 Memory and Cache *
4.4 Random-Access Memory and Cache *
@@ -1402,7 +1402,7 @@
<span class="md-ellipsis">
Chapter 5. Stack and Queue
Chapter 5. Stacks and Queues
@@ -1424,7 +1424,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 5. Stack and Queue
Chapter 5. Stacks and Queues
</label>
@@ -1502,7 +1502,7 @@
<span class="md-ellipsis">
5.3 Double-Ended Queue
5.3 Deque
@@ -1593,7 +1593,7 @@
<span class="md-ellipsis">
Chapter 6. Hashing
Chapter 6. Hash Table
@@ -1615,7 +1615,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 6. Hashing
Chapter 6. Hash Table
</label>
@@ -1888,7 +1888,7 @@
<span class="md-ellipsis">
7.3 Array Representation of Tree
7.3 Array Representation of Binary Trees
@@ -2107,7 +2107,7 @@
<span class="md-ellipsis">
8.2 Building a Heap
8.2 Heap Construction Operation
@@ -2135,7 +2135,7 @@
<span class="md-ellipsis">
8.3 Top-K Problem
8.3 Top-k Problem
@@ -2493,7 +2493,7 @@
<span class="md-ellipsis">
10.2 Binary Search Insertion
10.2 Binary Search Insertion Point
@@ -2521,7 +2521,7 @@
<span class="md-ellipsis">
10.3 Binary Search Edge Cases
10.3 Binary Search Boundaries
@@ -2577,7 +2577,7 @@
<span class="md-ellipsis">
10.5 Search Algorithms Revisited
10.5 Searching Algorithms Revisited
@@ -2726,7 +2726,7 @@
<span class="md-ellipsis">
11.1 Sorting Algorithms
11.1 Sorting Algorithm
@@ -3199,7 +3199,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
@@ -4281,7 +4281,7 @@
<ul>
<li><a href="installation/">16.1 &nbsp; Programming Environment Installation</a></li>
<li><a href="contribution/">16.2 &nbsp; Contributing Together</a></li>
<li><a href="terminology/">16.3 &nbsp; Terminology Table</a></li>
<li><a href="terminology/">16.3 &nbsp; Glossary</a></li>
</ul>
<!-- Source file information -->
en/chapter_appendix/installation/index.html
+35 -35
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">
@@ -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>
@@ -1183,7 +1183,7 @@
<span class="md-ellipsis">
Chapter 4. Array and Linked List
Chapter 4. Arrays and Linked Lists
@@ -1205,7 +1205,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 4. Array and Linked List
Chapter 4. Arrays and Linked Lists
</label>
@@ -1311,7 +1311,7 @@
<span class="md-ellipsis">
4.4 Memory and Cache *
4.4 Random-Access Memory and Cache *
@@ -1402,7 +1402,7 @@
<span class="md-ellipsis">
Chapter 5. Stack and Queue
Chapter 5. Stacks and Queues
@@ -1424,7 +1424,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 5. Stack and Queue
Chapter 5. Stacks and Queues
</label>
@@ -1502,7 +1502,7 @@
<span class="md-ellipsis">
5.3 Double-Ended Queue
5.3 Deque
@@ -1593,7 +1593,7 @@
<span class="md-ellipsis">
Chapter 6. Hashing
Chapter 6. Hash Table
@@ -1615,7 +1615,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 6. Hashing
Chapter 6. Hash Table
</label>
@@ -1888,7 +1888,7 @@
<span class="md-ellipsis">
7.3 Array Representation of Tree
7.3 Array Representation of Binary Trees
@@ -2107,7 +2107,7 @@
<span class="md-ellipsis">
8.2 Building a Heap
8.2 Heap Construction Operation
@@ -2135,7 +2135,7 @@
<span class="md-ellipsis">
8.3 Top-K Problem
8.3 Top-k Problem
@@ -2493,7 +2493,7 @@
<span class="md-ellipsis">
10.2 Binary Search Insertion
10.2 Binary Search Insertion Point
@@ -2521,7 +2521,7 @@
<span class="md-ellipsis">
10.3 Binary Search Edge Cases
10.3 Binary Search Boundaries
@@ -2577,7 +2577,7 @@
<span class="md-ellipsis">
10.5 Search Algorithms Revisited
10.5 Searching Algorithms Revisited
@@ -2726,7 +2726,7 @@
<span class="md-ellipsis">
11.1 Sorting Algorithms
11.1 Sorting Algorithm
@@ -3199,7 +3199,7 @@
<span class="md-ellipsis">
12.4 Hanoi Tower Problem
12.4 Hanota Problem
@@ -4114,7 +4114,7 @@
<a href="#1611-installing-ide" class="md-nav__link">
<span class="md-ellipsis">
16.1.1 &nbsp; Installing Ide
16.1.1 &nbsp; Installing IDE
</span>
</a>
@@ -4148,7 +4148,7 @@
<a href="#2-cc-environment" class="md-nav__link">
<span class="md-ellipsis">
2. &nbsp; C/c++ Environment
2. &nbsp; C/C++ Environment
</span>
</a>
@@ -4203,7 +4203,7 @@
<a href="#7-javascript-environment" class="md-nav__link">
<span class="md-ellipsis">
7. &nbsp; Javascript Environment
7. &nbsp; JavaScript Environment
</span>
</a>
@@ -4214,7 +4214,7 @@
<a href="#8-typescript-environment" class="md-nav__link">
<span class="md-ellipsis">
8. &nbsp; Typescript Environment
8. &nbsp; TypeScript Environment
</span>
</a>
@@ -4299,7 +4299,7 @@
<span class="md-ellipsis">
16.3 Terminology Table
16.3 Glossary
@@ -4417,7 +4417,7 @@
<a href="#1611-installing-ide" class="md-nav__link">
<span class="md-ellipsis">
16.1.1 &nbsp; Installing Ide
16.1.1 &nbsp; Installing IDE
</span>
</a>
@@ -4451,7 +4451,7 @@
<a href="#2-cc-environment" class="md-nav__link">
<span class="md-ellipsis">
2. &nbsp; C/c++ Environment
2. &nbsp; C/C++ Environment
</span>
</a>
@@ -4506,7 +4506,7 @@
<a href="#7-javascript-environment" class="md-nav__link">
<span class="md-ellipsis">
7. &nbsp; Javascript Environment
7. &nbsp; JavaScript Environment
</span>
</a>
@@ -4517,7 +4517,7 @@
<a href="#8-typescript-environment" class="md-nav__link">
<span class="md-ellipsis">
8. &nbsp; Typescript Environment
8. &nbsp; TypeScript Environment
</span>
</a>
@@ -4589,7 +4589,7 @@
<!-- Page content -->
<h1 id="161-programming-environment-installation">16.1 &nbsp; Programming Environment Installation<a class="headerlink" href="#161-programming-environment-installation" title="Permanent link">&para;</a></h1>
<h2 id="1611-installing-ide">16.1.1 &nbsp; Installing Ide<a class="headerlink" href="#1611-installing-ide" title="Permanent link">&para;</a></h2>
<h2 id="1611-installing-ide">16.1.1 &nbsp; Installing IDE<a class="headerlink" href="#1611-installing-ide" title="Permanent link">&para;</a></h2>
<p>We recommend using the open-source and lightweight VS Code as the local integrated development environment (IDE). Visit the <a href="https://code.visualstudio.com/">VS Code official website</a>, and download and install the appropriate version of VS Code according to your operating system.</p>
<p><img alt="Download VS Code from the Official Website" class="animation-figure" src="../installation.assets/vscode_installation.png" /></p>
<p align="center"> Figure 16-1 &nbsp; Download VS Code from the Official Website </p>
@@ -4601,11 +4601,11 @@
<h2 id="1612-installing-language-environments">16.1.2 &nbsp; Installing Language Environments<a class="headerlink" href="#1612-installing-language-environments" title="Permanent link">&para;</a></h2>
<h3 id="1-python-environment">1. &nbsp; Python Environment<a class="headerlink" href="#1-python-environment" title="Permanent link">&para;</a></h3>
<ol>
<li>Download and install <a href="https://docs.conda.io/en/latest/miniconda.html">Miniconda3</a>, which requires Python 3.10 or newer.</li>
<li>Download and install <a href="https://docs.conda.io/en/latest/miniconda.html">Miniconda3</a> with Python 3.10 or later.</li>
<li>Search for <code>python</code> in the VS Code extension marketplace and install the Python Extension Pack.</li>
<li>(Optional) Enter <code>pip install black</code> on the command line to install the code formatter.</li>
</ol>
<h3 id="2-cc-environment">2. &nbsp; C/c++ Environment<a class="headerlink" href="#2-cc-environment" title="Permanent link">&para;</a></h3>
<h3 id="2-cc-environment">2. &nbsp; C/C++ Environment<a class="headerlink" href="#2-cc-environment" title="Permanent link">&para;</a></h3>
<ol>
<li>Windows systems need to install <a href="https://sourceforge.net/projects/mingw-w64/files/">MinGW</a> (<a href="https://blog.csdn.net/qq_33698226/article/details/129031241">configuration tutorial</a>); macOS comes with Clang built-in and does not require installation.</li>
<li>Search for <code>c++</code> in the VS Code extension marketplace and install the C/C++ Extension Pack.</li>
@@ -4613,12 +4613,12 @@
</ol>
<h3 id="3-java-environment">3. &nbsp; Java Environment<a class="headerlink" href="#3-java-environment" title="Permanent link">&para;</a></h3>
<ol>
<li>Download and install <a href="https://jdk.java.net/18/">OpenJDK</a> (version must be &gt; JDK 9).</li>
<li>Download and install <a href="https://jdk.java.net/18/">OpenJDK</a> (version 10 or later).</li>
<li>Search for <code>java</code> in the VS Code extension marketplace and install the Extension Pack for Java.</li>
</ol>
<h3 id="4-c-environment">4. &nbsp; C# Environment<a class="headerlink" href="#4-c-environment" title="Permanent link">&para;</a></h3>
<ol>
<li>Download and install <a href="https://dotnet.microsoft.com/en-us/download">.Net 8.0</a>.</li>
<li>Download and install <a href="https://dotnet.microsoft.com/en-us/download">.NET 8.0</a>.</li>
<li>Search for <code>C# Dev Kit</code> in the VS Code extension marketplace and install C# Dev Kit (<a href="https://code.visualstudio.com/docs/csharp/get-started">configuration tutorial</a>).</li>
<li>You can also use Visual Studio (<a href="https://learn.microsoft.com/zh-cn/visualstudio/install/install-visual-studio?view=vs-2022">installation tutorial</a>).</li>
</ol>
@@ -4633,12 +4633,12 @@
<li>Download and install <a href="https://www.swift.org/download/">Swift</a>.</li>
<li>Search for <code>swift</code> in the VS Code extension marketplace and install <a href="https://marketplace.visualstudio.com/items?itemName=sswg.swift-lang">Swift for Visual Studio Code</a>.</li>
</ol>
<h3 id="7-javascript-environment">7. &nbsp; Javascript Environment<a class="headerlink" href="#7-javascript-environment" title="Permanent link">&para;</a></h3>
<h3 id="7-javascript-environment">7. &nbsp; JavaScript Environment<a class="headerlink" href="#7-javascript-environment" title="Permanent link">&para;</a></h3>
<ol>
<li>Download and install <a href="https://nodejs.org/en/">Node.js</a>.</li>
<li>(Optional) Search for <code>Prettier</code> in the VS Code extension marketplace and install the code formatter.</li>
</ol>
<h3 id="8-typescript-environment">8. &nbsp; Typescript Environment<a class="headerlink" href="#8-typescript-environment" title="Permanent link">&para;</a></h3>
<h3 id="8-typescript-environment">8. &nbsp; TypeScript Environment<a class="headerlink" href="#8-typescript-environment" title="Permanent link">&para;</a></h3>
<ol>
<li>Follow the same installation steps as the JavaScript environment.</li>
<li>Install <a href="https://github.com/privatenumber/tsx?tab=readme-ov-file#global-installation">TypeScript Execute (tsx)</a>.</li>
en/chapter_appendix/terminology/index.html
+25 -25
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>16.3 Terminology Table - Hello Algo</title>
<title>16.3 Glossary - Hello Algo</title>
@@ -99,7 +99,7 @@
<div data-md-component="skip">
<a href="#163-terminology-table" class="md-skip">
<a href="#163-glossary" 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">
16.3 &nbsp; Terminology Table
16.3 &nbsp; Glossary
</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>
@@ -1183,7 +1183,7 @@
<span class="md-ellipsis">
Chapter 4. Array and Linked List
Chapter 4. Arrays and Linked Lists
@@ -1205,7 +1205,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 4. Array and Linked List
Chapter 4. Arrays and Linked Lists
</label>
@@ -1311,7 +1311,7 @@
<span class="md-ellipsis">
4.4 Memory and Cache *
4.4 Random-Access Memory and Cache *
@@ -1402,7 +1402,7 @@
<span class="md-ellipsis">
Chapter 5. Stack and Queue
Chapter 5. Stacks and Queues
@@ -1424,7 +1424,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 5. Stack and Queue
Chapter 5. Stacks and Queues
</label>
@@ -1502,7 +1502,7 @@
<span class="md-ellipsis">
5.3 Double-Ended Queue
5.3 Deque
@@ -1593,7 +1593,7 @@
<span class="md-ellipsis">
Chapter 6. Hashing
Chapter 6. Hash Table
@@ -1615,7 +1615,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 6. Hashing
Chapter 6. Hash Table
</label>
@@ -1888,7 +1888,7 @@
<span class="md-ellipsis">
7.3 Array Representation of Tree
7.3 Array Representation of Binary Trees
@@ -2107,7 +2107,7 @@
<span class="md-ellipsis">
8.2 Building a Heap
8.2 Heap Construction Operation
@@ -2135,7 +2135,7 @@
<span class="md-ellipsis">
8.3 Top-K Problem
8.3 Top-k Problem
@@ -2493,7 +2493,7 @@
<span class="md-ellipsis">
10.2 Binary Search Insertion
10.2 Binary Search Insertion Point
@@ -2521,7 +2521,7 @@
<span class="md-ellipsis">
10.3 Binary Search Edge Cases
10.3 Binary Search Boundaries
@@ -2577,7 +2577,7 @@
<span class="md-ellipsis">
10.5 Search Algorithms Revisited
10.5 Searching Algorithms Revisited
@@ -2726,7 +2726,7 @@
<span class="md-ellipsis">
11.1 Sorting Algorithms
11.1 Sorting Algorithm
@@ -3199,7 +3199,7 @@
<span class="md-ellipsis">
12.4 Hanoi Tower Problem
12.4 Hanota Problem
@@ -4122,7 +4122,7 @@
<span class="md-ellipsis">
16.3 Terminology Table
16.3 Glossary
@@ -4266,10 +4266,10 @@
<!-- Page content -->
<h1 id="163-terminology-table">16.3 &nbsp; Terminology Table<a class="headerlink" href="#163-terminology-table" title="Permanent link">&para;</a></h1>
<h1 id="163-glossary">16.3 &nbsp; Glossary<a class="headerlink" href="#163-glossary" title="Permanent link">&para;</a></h1>
<p>The following table lists important terms that appear in this book. It is worth noting the following points:</p>
<ul>
<li>We recommend remembering the English names of terms to help with reading English literature.</li>
<li>We recommend remembering the English terms to help with reading English-language literature.</li>
<li>Some terms have different names in Simplified Chinese and Traditional Chinese.</li>
</ul>
<p align="center"> Table 16-1 &nbsp; Important Terms in Data Structures and Algorithms </p>