I need this question answered.
A “Hybird” sorting algorithm based on QuickSort or Merge Sort, which are both O(n log n), could use a simple algorithm like “insertion sort” for a finite number of cases with small n.
Use the “Big O” notation to demonstrate that the time complexity of such a hybrid algorithm is still O(n log n) when it is based on QuickSort even though it uses O(n^2) “insertion sort” for cases where n ≤ m = 20