Question 13.
Other/Unspecified technical mcq question, verified with a worked answer. Free to practise - no sign-up.
Find the time complexity of the following iterative code.
int i=0, j=N;// N is any positive integer
while(j>0)
{
i=i+1;
j=j/2;
}
Show answer & explanation
Answer: A. A) O(N)
Verified technical evaluation based on core computer science and mathematical principles.
Step-by-step Derivation:
Step 1: Parse problem constraints.
Step 2: Compute verified solution.
Step 3: Select matching option.