Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
P
Python-100-Days
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
huangkq
Python-100-Days
Commits
74c92de6
Unverified
Commit
74c92de6
authored
Feb 12, 2019
by
骆昊
Committed by
GitHub
Feb 12, 2019
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Update Python语言进阶.md
parent
4bbbed06
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
0 additions
and
8 deletions
+0
-8
Python语言进阶.md
Day16-20/Python语言进阶.md
+0
-8
No files found.
Day16-20/Python语言进阶.md
View file @
74c92de6
...
@@ -15,14 +15,6 @@
...
@@ -15,14 +15,6 @@
-
<img
src=
"http://latex.codecogs.com/gif.latex?O(n^3)"
/>
- 立方时间复杂度 - Floyd算法 / 矩阵乘法运算
-
<img
src=
"http://latex.codecogs.com/gif.latex?O(n^3)"
/>
- 立方时间复杂度 - Floyd算法 / 矩阵乘法运算
-
<img
src=
"http://latex.codecogs.com/gif.latex?O(2^n)"
/>
- 几何级数时间复杂度 - 汉诺塔
-
<img
src=
"http://latex.codecogs.com/gif.latex?O(2^n)"
/>
- 几何级数时间复杂度 - 汉诺塔
-
<img
src=
"http://latex.codecogs.com/gif.latex?O(n!)"
/>
- 阶乘时间复杂度 - 旅行经销商问题 - NP
-
<img
src=
"http://latex.codecogs.com/gif.latex?O(n!)"
/>
- 阶乘时间复杂度 - 旅行经销商问题 - NP
-
$O(c)$ - 常量时间复杂度 - 布隆过滤器 / 哈希存储
-
$O(log_2n)$ - 对数时间复杂度 - 折半查找(二分查找)
-
$O(n)$ - 线性时间复杂度 - 顺序查找 / 桶排序
-
$O(n
*
log_2n)$ - 对数线性时间复杂度 - 高级排序算法(归并排序、快速排序)
-
$O(n^2)$ - 平方时间复杂度 - 简单排序算法(选择排序、插入排序、冒泡排序)
-
$O(n^3)$ - 立方时间复杂度 - Floyd算法 / 矩阵乘法运算
-
$O(2^n)$ - 几何级数时间复杂度 - 汉诺塔
-
$O(n!)$ - 阶乘时间复杂度 - 旅行经销商问题 - NP
![](./res/algorithm_complexity_1.png)
![](./res/algorithm_complexity_1.png)
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment