I have created a recursive sorting merge method, and have a helper to check ascending, descending, and random, to reduce any other complexity by other sorting methods, but this still does not beat the introsort. The only method which does is shellsort but only when you add them into 1 array. I thought this was the only way it could be done, but does anyone have any other suggestions for merge sort, or to reduce complexity?
I have created a recursive sorting merge method, and have a helper to check ascending, descending, and random, to reduce any other complexity by other sorting methods, but this still does not beat the introsort. The only method which does is shellsort but only when you add them into 1 array. I thought this was the only way it could be done, but does anyone have any other suggestions for merge sort, or to reduce complexity?