A Sorting Algorithm Based on Selection Sort Strategy

This paper discusses an improved algorithm based on selection sorting,which employs stacks to remember previous compared information.This algorithm takes half of the original time in mass records.As for a small quantity of records,this algorithm is the best on the whole among all the sorting algorithms based on comparison and shift.Moreover,it is sensitive to the ordered degree of the original sort.When the original sort is comparatively in order,the speed is relatively high.The result shows that this sorting algorithm is quite fit for a small quantity of sorting,portion sorting,comparatively ordered sequence sorting and the combination with quick sort algorithms.