The Curious Case of Modified Merge Sort

We propose an O(N logN) sorting method by Modified Merge Sort Method, which shows huge potential to sort big data sets, and even better potential to sort big data sets with a smaller range. Six sorting algorithms: Selection Sort, Insertion sort, Merge sort, Quick sort, Bubble Sort and Modified Merge Sort were implemented in C++ programming languages and tested for the random sequence input of length 100, 1000, 4000, 9000 on random numbers and the IPL Dataset.