Exam-style question
Try this first
Why is bubble sort described as particularly inefficient in the specification?.
- A.It has time complexity O(n2)
- B.It cannot sort any list
- C.It always uses recursion
- D.It has time complexity O(1)
Model answer
What a good answer should say
- It has time complexity O(n2)
Explanation
Why this works
The specification identifies bubble sort as particularly inefficient because its time complexity is O(n2).
Common mistake
No common mistake is linked to this question yet.