Exam-style question
Try this first
Consider this Python 3 code: for item in data: print(item) What is the time complexity in terms of the number of items, n?.
- A.O(1)
- B.O(log n)
- C.O(n)
- D.O(n^2)
Model answer
What a good answer should say
- O(n)
Explanation
Why this works
The loop executes once for each item in data. Therefore, the number of operations grows in direct proportion to n.
Common mistake
No common mistake is linked to this question yet.
