CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 12:19:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2024-05-04 19:57:08 +08:00
parent 23353e7960
commit 689db9d610
515 changed files with 1239 additions and 538 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
en/chapter_computational_complexity/time_complexity/index.html
View File

@@ -4697,8 +4697,8 @@ T(n) & = n^2 + n & \text{Simplified Count (o.O)}
<p>Let's consider the input data size as <span class="arithmatex">\(n\)</span>. The common types of time complexities are illustrated below, arranged from lowest to highest:</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 Order} &lt; \text{Logarithmic Order} &lt; \text{Linear Order} &lt; \text{Linear-Logarithmic Order} &lt; \text{Quadratic Order} &lt; \text{Exponential Order} &lt; \text{Factorial Order}
&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{Log} &lt; \text{Linear} &lt; \text{Linear-Log} &lt; \text{Quadratic} &lt; \text{Exp} &lt; \text{Factorial}
\end{aligned}
\]</div>
<p><a class="glightbox" href="../time_complexity.assets/time_complexity_common_types.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="Common types of time complexity" class="animation-figure" src="../time_complexity.assets/time_complexity_common_types.png" /></a></p>