Create quick_sort_median_of_three

Implementation of the QuickSort algorithm that uses the median of the first, middle (floor middle), and last element of the input as the pivot element.  Short of the Median of Medians approach, this algorithm generally results in fewer comparisons than always using the first or the last element of a given array/subarray as a pivot element during partitioning.  This implementation also reports the number of comparisons made to track algorithms performance.  This algorithm also reads input from a single-column array of numbers: integers or floating point (read into an array of scalar values, which is passed by reference as subarrays within recursive calls).