To be written in C++. Do not contact me offering sub-contracting. I pay Chegg to get homework help; I'm not paying someone more to do the complete assignment. All comments of such nature will be reported.



It is well known that for large lists/array divide-and-conquer algorithms, such as MergeSort and QuickSort are, on average faster than BubbleSort and InsertionSort. However, for smaller lists, the recursion overhead in MergeSort and QuickSort wipes out the gain in the divide-and-conquer efficiency.

In this assignment you are to implement each of the four sorting algorithms separately.

Furthermore, you are to implement a HybridSort, which in addition to the obvious parameter, the list to be sorted, will take three more, as follows:

Large -- the name of the algorithm when the list to be sorted is large: MergeSort, or QuickSort

Small – the name of the algorithm to be used when the list to be sorted is small: BubbleSort, or InsertionSort

T – a threshold, a positive integer such that if the list to be sorted has more then T elements, then HybridSort behaves as Large sorting algorithm; as soon as the number of elements is less than or equal to T, HybridSort switches to Small algorithm. Obviously, the list should have at least T elements. You should consider several values of T between 8 and 16.

Thus, a call to HybridSort might look like HybridSort(LIST, "MergeSort", "InsertionSort", 6), which means that for lists larger than 6 HybridSort behaves like MergeSort and for lists of 6 or less elements InsertionSort is used.