algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-07 15:01:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

Polish the chapter

Browse Source 
introduction, computational complexity.
This commit is contained in:
krahets
2023-08-20 14:51:39 +08:00
parent 5fb728b3d6
commit 2626de8d0b
87 changed files with 375 additions and 371 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
codes/python/chapter_computational_complexity/time_complexity.py
View File

@ -121,31 +121,31 @@ if __name__ == "__main__":
print("输入数据大小 n =", n)
count: int = constant(n)
print("常数阶的计算操作数量 =", count)
print("常数阶的操作数量 =", count)
count: int = linear(n)
print("线性阶的计算操作数量 =", count)
print("线性阶的操作数量 =", count)
count: int = array_traversal([0] * n)
print("线性阶（遍历数组）的计算操作数量 =", count)
print("线性阶（遍历数组）的操作数量 =", count)
count: int = quadratic(n)
print("平方阶的计算操作数量 =", count)
print("平方阶的操作数量 =", count)
nums = [i for i in range(n, 0, -1)] # [n, n-1, ..., 2, 1]
count: int = bubble_sort(nums)
print("平方阶（冒泡排序）的计算操作数量 =", count)
print("平方阶（冒泡排序）的操作数量 =", count)
count: int = exponential(n)
print("指数阶（循环实现）的计算操作数量 =", count)
print("指数阶（循环实现）的操作数量 =", count)
count: int = exp_recur(n)
print("指数阶（递归实现）的计算操作数量 =", count)
print("指数阶（递归实现）的操作数量 =", count)
count: int = logarithmic(n)
print("对数阶（循环实现）的计算操作数量 =", count)
print("对数阶（循环实现）的操作数量 =", count)
count: int = log_recur(n)
print("对数阶（递归实现）的计算操作数量 =", count)
print("对数阶（递归实现）的操作数量 =", count)
count: int = linear_log_recur(n)
print("线性对数阶（递归实现）的计算操作数量 =", count)
print("线性对数阶（递归实现）的操作数量 =", count)
count: int = factorial_recur(n)
print("阶乘阶（递归实现）的计算操作数量 =", count)
print("阶乘阶（递归实现）的操作数量 =", count)