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