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

build

Browse Source
This commit is contained in:
krahets
2023-08-24 17:47:18 +08:00
parent 92a0853ab8
commit c6f0dfbdc8
10 changed files with 958 additions and 59 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
chapter_computational_complexity/summary.md
View File

@@ -2,7 +2,7 @@
comments: true
---
# 2.4   小结
# 2.5   小结
**算法效率评估**
@@ -26,7 +26,7 @@ comments: true
- 我们通常只关注最差空间复杂度，即统计算法在最差输入数据和最差运行时间点下的空间复杂度。
- 常见空间复杂度从小到大排列有 $O(1)$ 、$O(\log n)$ 、$O(n)$ 、$O(n^2)$ 、$O(2^n)$ 等。
## 2.4.1   Q & A
## 2.5.1   Q & A
!!! question "尾递归的空间复杂度是 $O(1)$ 吗？"