复杂度分析
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