Mid–Point Sorting Algorithm:A New Way to Sort

Abstract

In today’s era, one of the primary and crucial issues in computer science is all about systematic ordering of a set of items. Ordering forms a fundamental operation in different practical fields of Computer Sciences, Database Applications, Networks and Artificial Intelligence, etc. thereby attracting a massive amount of research in this field. Although, there exist a huge number of sorting algorithms to enhance the computational performance, there are several other factors that must be taken into account: time complexity, space complexity, stability. 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.