0
[Added later – this question is not part of the original paper]
What is the worst-case time complexity of bubble sort for n elements?
- AO(n)
- BO(log n)
- CO(n log n)
- DO(n²)
Correct answer: D
[Added later – this question is not part of the original paper]
What is the worst-case time complexity of bubble sort for n elements?