Adding O(n) and O(n²) gives
- Acheck_circle
O(n²)
- B
O(n + n²)
- C
O(n³)
- D
O(n)
Explanation
Big-O retains dominant term.
Informal Code Analysis (Loop Tracing)
AP Computer Science A· difficulty 4/5
Want 10 more like this — adaptive to your weak spots?
AP Computer Science A· difficulty 4/5
Adding O(n) and O(n²) gives
O(n²)
O(n + n²)
O(n³)
O(n)
Explanation
Big-O retains dominant term.
Want 10 more like this — adaptive to your weak spots?