This paper presents a new sorting algorithm that takes into account the mid-point of the unsorted array and checks for its neighbors in every iteration.

We proposed a new but simple and efficient merge sort technique. This method has several advantages on performance over previous merge sort technique. This technique divides the whole data as like ...