2) What is the time complexity of the following two algorithms? Express your answer in terms of Big-O notation and prov
Posted: Mon Mar 21, 2022 4:48 pm
2) What is the time complexity of the following two
algorithms? Express your answer in terms of Big-O notation and
provide simple steps of your derivation.
# algorithm A
for i in range(100, n):
for j in range(n, 100):
print(i,j)
# algorithm B
for i in range(0, n):
for j in range(0, n, 10):
print(i,j)
algorithms? Express your answer in terms of Big-O notation and
provide simple steps of your derivation.
# algorithm A
for i in range(100, n):
for j in range(n, 100):
print(i,j)
# algorithm B
for i in range(0, n):
for j in range(0, n, 10):
print(i,j)