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.
Answer:
im lost tell me a question then ill answer
Explanation:
Answer:
this one is not understandable you see but I think it's better than nothing to do with it tmzr I don't know what to say to someone who did you start the morning and you can not be able to get it to
Answer:
See attached picture.
Explanation:
See attached picture for detailed explanation.
