A novel in-place sorting algorithm with element wise restricted swap

Abstract

Constraint based sorting is considered to be one of the fundamental topics of discussion in computer science. Even though a large number of sorting algorithms have already been proposed and verified, but still new algorithms are being developed with respect to emerging problem statements. As sorting is the common operation of many algorithms, so efficient sorting makes easy searching, arranging and locating the information. This paper introduces a novel in-place sorting algorithm which works under the restriction of the number of movements. The restriction of movement is element wise i.e. there is a constraint on the number of movements for a particular element. The proposed algorithm is useful when cost of moving each element is not same and we have to sort the list keeping in mind that elements with higher movement cost should be swapped lesser number of times. In this paper, the algorithm has been presented with time complexity, space complexity analysis and experimental results.