|
|
O(1) O(log2^n) O(n^(1/2)) O(n) O(nlog2^n) O(n^2) O(n^3) O(2^n)
（a）
sum, i = 0, 0
while i**2 < n:
sum = sum + i
i += 2
(b)
i, j, sum =1,1,0
while i < n**3:
while j < n:
sum=sum+ i
j +== 1
i=i+n
(c)
i, sum =0,0
while i < 3 * n:
if i %2 == 0:
j =1
while j < n:
sum = sum + j
j=j*2
else :
j =1
while j < n:
sum = sum * j
j += (n // 5)
i=i+5
(d)
i, sum = 0, 0
while i *2<n:
sum = sum + i
i=i+1
|
|
