An Improvement on Selection Sort

Abstract

One of the most common applications in computer science is sorting, the process through which data are arranged according to their values. If the data were not ordered we would spend hours trying to find a single piece of information. The sorting of data can be obtained in a variety of ways, and only some of them can be considered meaningful and efficient. To decide which method is best, certain criteria of efficiency have to be established and a method for quantitatively comparing different algorithms must be chosen.Selection sort is one of the methods which is widely accepted and used.In this paper we analyze the Selection Sort and we improve the efficiency of the Selection Sort. The Execution time of the Selection Sort is reduced to nearly half by improving the Selection Sort.