Implement a Number of Data with One Swap Operation
Sorting is a method that arranges the list of elements in ascending or descending order. It is frequently used in a large variety of important applications used by schools, hospitals, banks and in many other organizations. There are many sorting methods having their own time and space complexity. This paper presents a novel sorting method named as SOS i.e. Swap Once and Sort. This method provides the correct position to an element by only one swap operation. It is based on the concept that, in ascending order list, all the elements after a particular element, will be greater than that element and vice versa for descending order list.