if its the same chart im looking at on this page, the answer is john.
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.
Using key words is the best way to search things in the search engine. make sure everything is spelled correctly.
Answer:
a. virtual reality
b. Master Boot Records
c. Primary function of a router
d. zoom
Explanation:
