1. 程式人生 > >Python 演算法練習

Python 演算法練習

複雜度分析

T(n) = O(f(n))
計算1+2+…+n 時間複雜度為 1 + n = n T(n) = O(n)
sums = 0
for i in range(101):
sums += i

計算i * j 時間複雜度為 n * n T(n) = O(n*n)
sums = 0
for i in range(3):
for j in range(3):
sums += i * j

T(n) = O(log n)
i = 0
while i <= 20:
i = i * 2