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

Bug fixes and improvements (#1318)

Browse Source 
* Sync zh and zh-hant versions

* Update en/README.md

* Add a Q&A for chapter of introduction

* Update the callout headers

* Sync zh ang zh-hant versions

* Bug fixes
This commit is contained in:
Yudong Jin
2024-04-30 15:52:05 +08:00
committed by GitHub
parent 84b1ce2497
commit 870e3e5cb2
107 changed files with 779 additions and 87 deletions
Download Patch File Download Diff File Expand all files Collapse all files
zh-hant/docs/chapter_computational_complexity/time_complexity.md
+1 -1
View File
@@ -747,7 +747,7 @@ $T(n)$ 是一次函式，說明其執行時間的增長趨勢是線性的，因
時間複雜度分析本質上是計算“操作數量 $T(n)$”的漸近上界，它具有明確的數學定義。
!!! abstract "函式漸近上界"
!!! note "函式漸近上界"
若存在正實數 $c$ 和實數 $n_0$ ，使得對於所有的 $n > n_0$ ，均有 $T(n) \leq c \cdot f(n)$ ，則可認為 $f(n)$ 給出了 $T(n)$ 的一個漸近上界，記為 $T(n) = O(f(n))$ 。