My personal favorite is Metal gear solid 3: <em>Snake eater</em>.
<span>c. database is the answer.</span>
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:
electronic processing device
Opening unfamiler emails and visiting unknown websites
