Try this exercise. Click the correct answer from the options.
Which is correct when looking at insertion sort's time complexity?
Click the option that best answers the question.
- O(n$^2$) in worst case
- O(n log n) in worst case
- O(n) in worst case
Back to course sections
Mark As Completed Discussion