Are you sure you're getting this? Is this statement true or false?
Insertion sort has a time complexity of O(n^2).
Press true if you believe the statement is correct, or false otherwise.
Back to course sections
Mark As Completed Discussion
Insertion sort has a time complexity of O(n^2).
Press true if you believe the statement is correct, or false otherwise.