Abstract-One of the fundamental areas of the
computer science is Data Structure. Sorting is a
major issue in Data Structure which creates the
sequence of the list of items. Though numbers of
sorting algorithms are available, it is necessary to
select the best sorting algorithm. So sorting problem
has attracted a great deal of research as sorting
technique is frequently used in a large variety of
important applications to arrange the data in
ascending or descending order. This paper presents a
Double Ended Selection Sort Algorithm which is
faster than the selection sort. The new algorithm is
analyzed, implemented, tested. The test results are
presented and compared with the traditional selection
sort.