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.
Non-Volatile Random Access Memory
The type of physical drives does windows disable defragmenting, but provides another method of optimization is known as windows.
<h3>What is windows?</h3>
It should be noted that windows is a separate viewing area on a computer display screen in a system.
In this case, the type of physical drives does windows disable defragmenting, but provides another method of optimization is known as windows.
Learn more about window on:
brainly.com/question/25243683
#SPJ12
