C++ Coding Help

You will implement Hybrid Sort algorithm. This hybrid sort algorithm starts with the quick sort, but when the partition size becomes less than or equal to 10, sorts that partition with the insertion sort. You are supposed to take the last element of the array as the pivot.

Your function should take an array of integers and the size of that array and then sort it in increasing order. Add two counters to count the number of key comparisons and the number of data moves during sorting. Your function should have the following prototype:

void hybridSort(int *arr, int size, int &compCount, int &moveCount);

For key comparisons, you should count each comparison like k1 < k2 as one comparison, where k1 and k2 correspond to the value of an array entry (that is, they are either an array entry like arr[i] or a local variable that temporarily keeps the value of an array entry). For data moves, you should count each assignment as one move, where either the right-hand side of this assignment or its left-hand side or both of its sides correspond to the value of an array entry.