SLSort (Smallest-Largest Swap Sort) – A Sorting Algorithm
Hirkani Padwad · International Journal of Advanced Trends in Computer Science and Engineering · 2020
Sorting problem is one of the classic problems of Computer Science.Sorting is among the most basic tasks involved in computation and is very commonly used in almost every application.Design of a fast sorting algorithm has always been a challenge and there has been a lot of research since many decades.A variety of sorting algorithms have been designed amongst which Quicksort is considered as the fastest in-place sorting algorithm and Timsort is being used in practically for sorting problems in programming languages like Java and Python.Few parallelized versions of sorting algorithms have also been developed.This paper proposes a Divide and Conquer based scheme of in-place sorting which sorts the array using repeated swap operations of largest and small elements of two sub-arrays of the original array.The procedure is recursively applied on the sub-arrays until they are reduced to size 1.Analysis and results show that the algorithm performs better than quicksort for an input that is almost or completely sorted.