This code does a good sorting one a given array of n numbers. It uses the concept of divide and conquer paradigm which calculates the sorted array in O(nlogn) time which is the most efficient order for sorting numbers