---

An Enhanced Selection Sort Algorithm

Corresponding Author : Md. Khairullah (khairullah-cse@sust.edu)

Keywords : Current maximum, Former maximum, Stack, Complexity

Abstract :

Sorting is a commonly used operation in computer science. In addition to its main job, sorting is often required to facilitate some other operations such as searching, merging and normalization. There are many sorting algorithm that are being used in practical life as well as in computation. A sorting algorithm consists of comparison, swap, and assignment operations. In this paper an enhanced version of the classical selection sort algorithm is presented, which eliminates some unnecessary comparisons to find the maximum in each pass of the classical algorithm. A stack is used to store the locations of the past or local maximums to accelerate the process. A significant improvement (around 220%) for random data and even better (around 230%) for a reversely sorted list is achieved

Published on June 30th, 2014 in Volume 21, Issue 1, Applied Sciences and Technology