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

deploy

Browse source
This commit is contained in:
krahets 2023-12-22 04:04:47 +08:00
parent 4fe3455037
commit 421bd4ef2c
21 changed files with 101 additions and 101 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
en/404.html
View file

@ -496,7 +496,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -577,7 +577,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -593,7 +593,7 @@
<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>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>

14
en/chapter_computational_complexity/index.html
View file

@ -26,7 +26,7 @@
<title>第 2 章   Complexity Analysis - Hello Algo</title>
<title>Chapter 2.   Complexity Analysis - Hello Algo</title>
@ -91,7 +91,7 @@
<div data-md-component="skip">
<a href="#2-complexity-analysis" class="md-skip">
<a href="#chapter-2-complexity-analysis" class="md-skip">
Skip to content
</a>
@ -126,7 +126,7 @@
<div class="md-header__topic" data-md-component="header-topic">
<span class="md-ellipsis">
第 2 章 &nbsp; Complexity Analysis
Chapter 2. &nbsp; Complexity Analysis
</span>
</div>
@ -518,7 +518,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -601,7 +601,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -617,7 +617,7 @@
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_3_label" aria-expanded="true">
<label class="md-nav__title" for="__nav_3">
<span class="md-nav__icon md-icon"></span>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -806,7 +806,7 @@
<!-- Page content -->
<h1 id="2-complexity-analysis">第 2 章 &nbsp; Complexity Analysis<a class="headerlink" href="#2-complexity-analysis" title="Permanent link">&para;</a></h1>
<h1 id="chapter-2-complexity-analysis">Chapter 2. &nbsp; Complexity Analysis<a class="headerlink" href="#chapter-2-complexity-analysis" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_complexity_analysis.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="complexity_analysis" class="cover-image" src="../assets/covers/chapter_complexity_analysis.jpg" /></a></p>
</div>

6
en/chapter_computational_complexity/iteration_and_recursion/index.html
View file

@ -518,7 +518,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -601,7 +601,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -617,7 +617,7 @@
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_3_label" aria-expanded="true">
<label class="md-nav__title" for="__nav_3">
<span class="md-nav__icon md-icon"></span>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>

14
en/chapter_computational_complexity/performance_evaluation/index.html
View file

@ -518,7 +518,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -601,7 +601,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -617,7 +617,7 @@
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_3_label" aria-expanded="true">
<label class="md-nav__title" for="__nav_3">
<span class="md-nav__icon md-icon"></span>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -932,7 +932,7 @@ aria-label="Footer"
<a
href="../"
class="md-footer__link md-footer__link--prev"
aria-label="Previous: 第 2 章 &amp;nbsp; Complexity Analysis"
aria-label="Previous: Chapter 2. &amp;nbsp; Complexity Analysis"
rel="prev"
>
<div class="md-footer__button md-icon">
@ -944,7 +944,7 @@ aria-label="Footer"
Previous
</span>
<div class="md-ellipsis">
第 2 章 &nbsp; Complexity Analysis
Chapter 2. &nbsp; Complexity Analysis
</div>
</div>
</a>
@ -1057,7 +1057,7 @@ aria-label="Footer"
<nav class="md-footer__inner md-grid" aria-label="Footer" >
<a href="../" class="md-footer__link md-footer__link--prev" aria-label="Previous: 第 2 章 &amp;nbsp; Complexity Analysis">
<a href="../" class="md-footer__link md-footer__link--prev" aria-label="Previous: Chapter 2. &amp;nbsp; Complexity Analysis">
<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>
@ -1067,7 +1067,7 @@ aria-label="Footer"
Previous
</span>
<div class="md-ellipsis">
第 2 章 &nbsp; Complexity Analysis
Chapter 2. &nbsp; Complexity Analysis
</div>
</div>
</a>

6
en/chapter_computational_complexity/space_complexity/index.html
View file

@ -518,7 +518,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -601,7 +601,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -617,7 +617,7 @@
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_3_label" aria-expanded="true">
<label class="md-nav__title" for="__nav_3">
<span class="md-nav__icon md-icon"></span>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>

6
en/chapter_computational_complexity/summary/index.html
View file

@ -516,7 +516,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -599,7 +599,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -615,7 +615,7 @@
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_3_label" aria-expanded="true">
<label class="md-nav__title" for="__nav_3">
<span class="md-nav__icon md-icon"></span>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>

6
en/chapter_computational_complexity/time_complexity/index.html
View file

@ -518,7 +518,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -601,7 +601,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -617,7 +617,7 @@
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_3_label" aria-expanded="true">
<label class="md-nav__title" for="__nav_3">
<span class="md-nav__icon md-icon"></span>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>

6
en/chapter_data_structure/classification_of_data_structure/index.html
View file

@ -514,7 +514,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -595,7 +595,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -611,7 +611,7 @@
<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>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>

6
en/chapter_data_structure/index.html
View file

@ -514,7 +514,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -595,7 +595,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -611,7 +611,7 @@
<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>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>

22
en/chapter_introduction/algorithms_are_everywhere/index.html
View file

@ -530,7 +530,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -611,7 +611,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -627,7 +627,7 @@
<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>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -879,7 +879,7 @@ aria-label="Footer"
<a
href="../"
class="md-footer__link md-footer__link--prev"
aria-label="Previous: 第 1 章 &amp;nbsp; Introduction to Algorithms"
aria-label="Previous: Chapter 1. &amp;nbsp; Introduction to Algorithms"
rel="prev"
>
<div class="md-footer__button md-icon">
@ -891,7 +891,7 @@ aria-label="Footer"
Previous
</span>
<div class="md-ellipsis">
第 1 章 &nbsp; Introduction to Algorithms
Chapter 1. &nbsp; Introduction to Algorithms
</div>
</div>
</a>
@ -903,7 +903,7 @@ aria-label="Footer"
<a
href="../what_is_dsa/"
class="md-footer__link md-footer__link--next"
aria-label="Next: 1.2 What is Algorithms"
aria-label="Next: 1.2 What Is Algorithms"
rel="next"
>
<div class="md-footer__title">
@ -911,7 +911,7 @@ aria-label="Footer"
Next
</span>
<div class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</div>
</div>
<div class="md-footer__button md-icon">
@ -1004,7 +1004,7 @@ aria-label="Footer"
<nav class="md-footer__inner md-grid" aria-label="Footer" >
<a href="../" class="md-footer__link md-footer__link--prev" aria-label="Previous: 第 1 章 &amp;nbsp; Introduction to Algorithms">
<a href="../" class="md-footer__link md-footer__link--prev" aria-label="Previous: Chapter 1. &amp;nbsp; Introduction to Algorithms">
<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>
@ -1014,20 +1014,20 @@ aria-label="Footer"
Previous
</span>
<div class="md-ellipsis">
第 1 章 &nbsp; Introduction to Algorithms
Chapter 1. &nbsp; Introduction to Algorithms
</div>
</div>
</a>
<a href="../what_is_dsa/" class="md-footer__link md-footer__link--next" aria-label="Next: 1.2 What is Algorithms">
<a href="../what_is_dsa/" class="md-footer__link md-footer__link--next" aria-label="Next: 1.2 What Is Algorithms">
<div class="md-footer__title">
<span class="md-footer__direction">
Next
</span>
<div class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</div>
</div>
<div class="md-footer__button md-icon">

16
en/chapter_introduction/index.html
View file

@ -26,7 +26,7 @@
<title>第 1 章   Introduction to Algorithms - Hello Algo</title>
<title>Chapter 1.   Introduction to Algorithms - Hello Algo</title>
@ -91,7 +91,7 @@
<div data-md-component="skip">
<a href="#1-introduction-to-algorithms" class="md-skip">
<a href="#chapter-1-introduction-to-algorithms" class="md-skip">
Skip to content
</a>
@ -126,7 +126,7 @@
<div class="md-header__topic" data-md-component="header-topic">
<span class="md-ellipsis">
第 1 章 &nbsp; Introduction to Algorithms
Chapter 1. &nbsp; Introduction to Algorithms
</span>
</div>
@ -520,7 +520,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -601,7 +601,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -617,7 +617,7 @@
<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>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -806,7 +806,7 @@
<!-- Page content -->
<h1 id="1-introduction-to-algorithms">第 1 章 &nbsp; Introduction to Algorithms<a class="headerlink" href="#1-introduction-to-algorithms" title="Permanent link">&para;</a></h1>
<h1 id="chapter-1-introduction-to-algorithms">Chapter 1. &nbsp; Introduction to Algorithms<a class="headerlink" href="#chapter-1-introduction-to-algorithms" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_introduction.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="A first look at the algorithm" class="cover-image" src="../assets/covers/chapter_introduction.jpg" /></a></p>
</div>
@ -818,7 +818,7 @@
<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; Algorithms Are Everywhere</a></li>
<li><a href="https://www.hello-algo.com/chapter_introduction/what_is_dsa/">1.2 &nbsp; What is Algorithms</a></li>
<li><a href="https://www.hello-algo.com/chapter_introduction/what_is_dsa/">1.2 &nbsp; What Is Algorithms</a></li>
<li><a href="https://www.hello-algo.com/chapter_introduction/summary/">1.3 &nbsp; Summary</a></li>
</ul>

22
en/chapter_introduction/summary/index.html
View file

@ -520,7 +520,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -611,7 +611,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -627,7 +627,7 @@
<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>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -831,7 +831,7 @@ aria-label="Footer"
<a
href="../what_is_dsa/"
class="md-footer__link md-footer__link--prev"
aria-label="Previous: 1.2 What is Algorithms"
aria-label="Previous: 1.2 What Is Algorithms"
rel="prev"
>
<div class="md-footer__button md-icon">
@ -843,7 +843,7 @@ aria-label="Footer"
Previous
</span>
<div class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</div>
</div>
</a>
@ -855,7 +855,7 @@ aria-label="Footer"
<a
href="../../chapter_computational_complexity/"
class="md-footer__link md-footer__link--next"
aria-label="Next: 第 2 章 &amp;nbsp; Complexity Analysis"
aria-label="Next: Chapter 2. &amp;nbsp; Complexity Analysis"
rel="next"
>
<div class="md-footer__title">
@ -863,7 +863,7 @@ aria-label="Footer"
Next
</span>
<div class="md-ellipsis">
第 2 章 &nbsp; Complexity Analysis
Chapter 2. &nbsp; Complexity Analysis
</div>
</div>
<div class="md-footer__button md-icon">
@ -956,7 +956,7 @@ aria-label="Footer"
<nav class="md-footer__inner md-grid" aria-label="Footer" >
<a href="../what_is_dsa/" class="md-footer__link md-footer__link--prev" aria-label="Previous: 1.2 What is Algorithms">
<a href="../what_is_dsa/" class="md-footer__link md-footer__link--prev" aria-label="Previous: 1.2 What Is Algorithms">
<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>
@ -966,20 +966,20 @@ aria-label="Footer"
Previous
</span>
<div class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</div>
</div>
</a>
<a href="../../chapter_computational_complexity/" class="md-footer__link md-footer__link--next" aria-label="Next: 第 2 章 &amp;nbsp; Complexity Analysis">
<a href="../../chapter_computational_complexity/" class="md-footer__link md-footer__link--next" aria-label="Next: Chapter 2. &amp;nbsp; Complexity Analysis">
<div class="md-footer__title">
<span class="md-footer__direction">
Next
</span>
<div class="md-ellipsis">
第 2 章 &nbsp; Complexity Analysis
Chapter 2. &nbsp; Complexity Analysis
</div>
</div>
<div class="md-footer__button md-icon">

12
en/chapter_introduction/what_is_dsa/index.html
View file

@ -26,7 +26,7 @@
<title>1.2 What is Algorithms - Hello Algo</title>
<title>1.2 What Is Algorithms - Hello Algo</title>
@ -126,7 +126,7 @@
<div class="md-header__topic" data-md-component="header-topic">
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
</div>
@ -529,7 +529,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -540,7 +540,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -668,7 +668,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -684,7 +684,7 @@
<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>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>

18
en/chapter_preface/about_the_book/index.html
View file

@ -587,7 +587,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -668,7 +668,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -684,7 +684,7 @@
<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>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -926,8 +926,8 @@
<li>Thanks to @squidfunk for writing layout suggestions and for developing the open source documentation theme <a href="https://github.com/squidfunk/mkdocs-material/tree/master">Material-for-MkDocs</a>.</li>
</ul>
<p>During the writing process, I read many textbooks and articles on data structures and algorithms. These works provide excellent models for this book and ensure the accuracy and quality of its contents. I would like to thank all my teachers and predecessors for their outstanding contributions!</p>
<p>This book promotes a hands-on approach to learning, and in this respect is heavily inspired by <a href="https://github.com/d2l-ai/d2l-zh">"Hands-On Learning for Depth"</a>. I highly recommend this excellent book to all readers.</p>
<p>A heartfelt thank you to my parents, it is your constant support and encouragement that gives me the opportunity to do this fun-filled thing.</p>
<p>This book promotes a hands-on approach to learning, and in this respect is heavily inspired by <a href="https://github.com/d2l-ai/d2l-zh">"Dive into Deep Learning"</a>. I highly recommend this excellent book to you.</p>
<p><strong>A heartfelt thank you to my parents, it is your constant support and encouragement that gives me the opportunity to do this fun-filled thing</strong>.</p>
<!-- Source file information -->
@ -950,7 +950,7 @@ aria-label="Footer"
<a
href="../"
class="md-footer__link md-footer__link--prev"
aria-label="Previous: 第 0 章 &amp;nbsp; Preface"
aria-label="Previous: Chapter 0. &amp;nbsp; Preface"
rel="prev"
>
<div class="md-footer__button md-icon">
@ -962,7 +962,7 @@ aria-label="Footer"
Previous
</span>
<div class="md-ellipsis">
第 0 章 &nbsp; Preface
Chapter 0. &nbsp; Preface
</div>
</div>
</a>
@ -1075,7 +1075,7 @@ aria-label="Footer"
<nav class="md-footer__inner md-grid" aria-label="Footer" >
<a href="../" class="md-footer__link md-footer__link--prev" aria-label="Previous: 第 0 章 &amp;nbsp; Preface">
<a href="../" class="md-footer__link md-footer__link--prev" aria-label="Previous: Chapter 0. &amp;nbsp; Preface">
<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>
@ -1085,7 +1085,7 @@ aria-label="Footer"
Previous
</span>
<div class="md-ellipsis">
第 0 章 &nbsp; Preface
Chapter 0. &nbsp; Preface
</div>
</div>
</a>

14
en/chapter_preface/index.html
View file

@ -24,7 +24,7 @@
<title>第 0 章   Preface - Hello Algo</title>
<title>Chapter 0.   Preface - Hello Algo</title>
@ -89,7 +89,7 @@
<div data-md-component="skip">
<a href="#0-preface" class="md-skip">
<a href="#chapter-0-preface" class="md-skip">
Skip to content
</a>
@ -124,7 +124,7 @@
<div class="md-header__topic" data-md-component="header-topic">
<span class="md-ellipsis">
第 0 章 &nbsp; Preface
Chapter 0. &nbsp; Preface
</span>
</div>
@ -518,7 +518,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -599,7 +599,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -615,7 +615,7 @@
<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>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -804,7 +804,7 @@
<!-- Page content -->
<h1 id="0-preface">第 0 章 &nbsp; Preface<a class="headerlink" href="#0-preface" title="Permanent link">&para;</a></h1>
<h1 id="chapter-0-preface">Chapter 0. &nbsp; Preface<a class="headerlink" href="#chapter-0-preface" title="Permanent link">&para;</a></h1>
<div class="center-table">
<p><a class="glightbox" href="../assets/covers/chapter_preface.jpg" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="Preface" class="cover-image" src="../assets/covers/chapter_preface.jpg" /></a></p>
</div>

6
en/chapter_preface/suggestions/index.html
View file

@ -605,7 +605,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -686,7 +686,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -702,7 +702,7 @@
<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>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>

14
en/chapter_preface/summary/index.html
View file

@ -530,7 +530,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -611,7 +611,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -627,7 +627,7 @@
<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>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -854,7 +854,7 @@ aria-label="Footer"
<a
href="../../chapter_introduction/"
class="md-footer__link md-footer__link--next"
aria-label="Next: 第 1 章 &amp;nbsp; Introduction to Algorithms"
aria-label="Next: Chapter 1. &amp;nbsp; Introduction to Algorithms"
rel="next"
>
<div class="md-footer__title">
@ -862,7 +862,7 @@ aria-label="Footer"
Next
</span>
<div class="md-ellipsis">
第 1 章 &nbsp; Introduction to Algorithms
Chapter 1. &nbsp; Introduction to Algorithms
</div>
</div>
<div class="md-footer__button md-icon">
@ -972,13 +972,13 @@ aria-label="Footer"
<a href="../../chapter_introduction/" class="md-footer__link md-footer__link--next" aria-label="Next: 第 1 章 &amp;nbsp; Introduction to Algorithms">
<a href="../../chapter_introduction/" class="md-footer__link md-footer__link--next" aria-label="Next: Chapter 1. &amp;nbsp; Introduction to Algorithms">
<div class="md-footer__title">
<span class="md-footer__direction">
Next
</span>
<div class="md-ellipsis">
第 1 章 &nbsp; Introduction to Algorithms
Chapter 1. &nbsp; Introduction to Algorithms
</div>
</div>
<div class="md-footer__button md-icon">

6
en/index.html
View file

@ -500,7 +500,7 @@
<span class="md-ellipsis">
1.2 What is Algorithms
1.2 What Is Algorithms
</span>
@ -581,7 +581,7 @@
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6 2h12v6l-4 4 4 4v6H6v-6l4-4-4-4V2m10 14.5-4-4-4 4V20h8v-3.5m-4-5 4-4V4H8v3.5l4 4M10 6h4v.75l-2 2-2-2V6Z"/></svg>
<span class="md-ellipsis">
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</span>
@ -597,7 +597,7 @@
<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>
Chapter 2. Computational Complexity
Chapter 2. Complexity Analysis
</label>
<ul class="md-nav__list" data-md-scrollfix>

2
en/search/search_index.json
View file

File diff suppressed because one or more lines are too long

BIN
en/sitemap.xml.gz
View file

Binary file not shown.

BIN
sitemap.xml.gz
View file

Binary file not shown.