Sorting Algorithms Questions
The worst-case time complexity of merge-insertion sort is O(n^2), where n is the number of elements to be sorted.