A loop <code>for (int i = 1; i < n; i *= 2)</code> has time complexity
- A
O(n²)
- Bcheck_circle
O(log n)
- C
O(n)
- D
O(1)
Explanation
i doubles each iteration; runs about log₂(n) times.
Informal Code Analysis (Loop Tracing)
AP Computer Science A· difficulty 4/5
Want 10 more like this — adaptive to your weak spots?
Related questions
- csa-mix-025
What does this print? <codeint x = 0; for (int i = 0; i < 5; i++); x++; System.out.println(x); </code</pre…
chevron_right - csa-iter-032
What is the final value of x? <codeint x = 1; for (int i = 1; i <= 3; i++) x = 2; </code</pre…
chevron_right - csa-mix-109
Adding O(n) and O(n²) gives…
chevron_right