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.