What is running time of insertion sort in worst case?
What is running time of insertion sort in worst case? Insertion sort has an average and worst-case running time of O ( n 2 ) O(n^2) O(n2), so in most cases, a faster algorithm is more desirable. What would be an example of a worst case scenario for insertion sort? Read more…