ABSTRACT

Sorting is a technique which is frequently used in our day to day life. It has a direct implication on searching. If the data is sorted on any key attribute, finding data based on that key attribute becomes very fast. There are many sorting algorithm that are being used in practical life as well as in computation. We will concentrate on selection sort in this context that has already been used for so many years and are providing a solution to make it more faster as compared to previous one. The upgraded Selection sort works by repeatedly selecting the minimum or the maximum value and placing them in their proper position in the list. We provide a method of selecting both the minimum and the maximum value simultaneously and placing them in their respective positions in a single pass. so that the length of array reduces by two elements in each pass which reduces the number of passes by n/2.Thus array get sorted in ascending order from the beginning of the array, and in descending order from the end and hence the sorting is done from both the ends of the array and hence the array is sorted in less time using this upgraded selection sort as compared to the original selection sort. The complexity of the upgraded selection sort provided in this work comes out to be same as that of the original selection sort ?(n2) but the total number of passes in the original selection sort is n and in upgraded algorithm is n/2.