当n值较大时:
import time
def sum12n(n):
s = 0
start = time.time()
for j in range(1, n + 1):
s += j
end = time.time()
return s, end - start
for i in range(6):
sum1 = sum12n(1000000)
print(f"sum ={sum1}")
运行结果如下:
sum =(500000500000, 0.06383061408996582)
sum =(500000500000, 0.06685447692871094)
sum =(500000500000, 0.06183195114135742)
sum =(500000500000, 0.05984020233154297)
sum =(500000500000, 0.06283259391784668)
sum =(500000500000, 0.06180167198181152)
当n值较小时:
import time
def sum12n(n):
s = 0
start = time.time()
for j in range(1, n + 1):
s += j
end = time.time()
return s, end - start
for i in range(6):
sum1 = sum12n(100)
print(f"sum ={sum1}")
运行结果如下:
sum =(5050, 0.0)
sum =(5050, 0.0)
sum =(5050, 0.0)
sum =(5050, 0.0)
sum =(5050, 0.0)
sum =(5050, 0.0)
我们可以看出,当n值较小时,如 n=100时,运算时间几乎为零,可忽略不计!且通过循环,我们可以发现:即使同一个n值累加求和,其运行时间也不完全相同,大家可以利用上述程序进行测试。