In case of insertion sort, If the array is in reverse sorted order—that is, in decreasing order—the worst case results. why? We can express this worst-case running time as a(n^2) +bn+c for constants a, b and c. How?
Sorting Algorithms: Let A and B be two linear arrays. How to merge these two arrays into a new array C?