Selective Sorting Algorithm from Both Ends in Arrays

The core computation commonly used in data processing is sorting. The percentage of CPU time used in sorting is from 20% to 60% in some business computers. This paper brings forward an optimized selective sorting algorithm by sorting from both ends simultaneously. Since the time of comparison in this sorting is only half of the commonly used selective sorting, the computer running time is greatly decreased, and the computer work efficiency is highly increased. This sorting method can be used as reference in other sorting algorithm.