You are on page 1of 2

Find time and space complexity

Question#1:
sum = 0;
for I in range(n):
sum+=1

Statement Number of times executed


sum=0 1
for i in range(n): n+1
sum++ N
Total 2n+2
Time complexity T(n) = 2n+2,T(n) = O(n)
Space complexity O(1)

Question#2:
a = 0
b = 0
for i in range(N):
a = a + random()

for i in range(M):
b= b + random()

Question#3:
a = 0;
for i in range(N):
for j in reversed(range(i,N)):
a = a + i + j;

Question#4:
k = 0;
for i in range(n//2,n):
for j in range(2,n,pow(2,j)):
k = k + n / 2;
Question#5:
a = 0
i = N
while (i > 0):
a += i
i //= 2

Question#6:
for i in range(n):
i=i*k

Question#7:
value = 0;
for i in range(n):
for j in range(i):
value=value+1

Question#8:
i = 1
j = 1
while ( i < = n):
while (j <= n):
j=j*2
i = i*2

You might also like