Sorting by Selection Method and Its Improvement

Selection sorting is a common sorting method, which is more efficient because it exchanges data less times than bubble sorting. Selection sorting is an unstable sorting algorithm. It works by selecting the smallest element each time from the data elements to be sorted and storing it at the end of the ordered area, then continuing to find the smallest element from the remaining unsorted elements and placing it at the end of the ordered area, and so on until the data element in the unordered region is empty. This paper describes the basic selection method sorting and two improved selection method sorting^[1].