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

deploy

Browse Source
This commit is contained in:
krahets
2026-04-04 23:10:58 +08:00
parent 5b59dbded2
commit fec71ace08
168 changed files with 308 additions and 963 deletions
Download Patch File Download Diff File Expand all files Collapse all files
en/chapter_computational_complexity/time_complexity/index.html
+4 -4
View File
@@ -1809,7 +1809,7 @@
<span class="md-ellipsis">
Chapter 6. Hash Table
Chapter 6. Hashing
@@ -1831,7 +1831,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 6. Hash Table
Chapter 6. Hashing
</label>
@@ -5547,8 +5547,8 @@ T(n) &amp; = n^2 + n &amp; \text{Simplified count (o.O)}
<p>Let the input data size be <span class="arithmatex">\(n\)</span>. Common time complexity types are shown in Figure 2-9 (arranged in order from low to high).</p>
<div class="arithmatex">\[
\begin{aligned}
O(1) &lt; O(\log n) &lt; O(n) &lt; O(n \log n) &lt; O(n^2) &lt; O(2^n) &lt; O(n!) \newline
\text{Constant} &lt; \text{Logarithmic} &lt; \text{Linear} &lt; \text{Linearithmic} &lt; \text{Quadratic} &lt; \text{Exponential} &lt; \text{Factorial}
&amp; O(1) &lt; O(\log n) &lt; O(n) &lt; O(n \log n) &lt; O(n^2) &lt; O(2^n) &lt; O(n!) \newline
&amp; \text{Constant} &lt; \text{Logarithmic} &lt; \text{Linear} &lt; \text{Linearithmic} &lt; \text{Quadratic} &lt; \text{Exponential} &lt; \text{Factorial}
\end{aligned}
\]</div>
<p><img alt="Common time complexity types" class="animation-figure" src="../time_complexity.assets/time_complexity_common_types.png" /></p>