3
thank me later :))))))))
because it's a good thing
for count in range(5, 8):
print(count)
This will produce.
5
6
7
I hope this helps!
Answer:
The time complexity of the code is O(log₇n).
Explanation:
The i is updated by 7*i.On each iteration i is multiplied by 7.So on finding the time complexity of the code given above it will come out to be log base 7.
When we divide the input by 2 the time complexity is log base 2.
So on dividing it by 7 we get the time complexity of log base 7.
