Improved bidirectional selection sort algorithm
Min Wang · Information technology newsletter · 2010
This paper analyzes in detail the bidirectional selection sort algorithm design ideas,gives two kinds of algorithm description in C,and points out the oversights about the algorithm description in some reference papers.After analyzing comparatively the time complexity and space complexity of all the algorithms,the paper summarizes the pros and cons of the two algorithm design methods,thus gives a theoretical basis for the traditional simple selection sort algorithm optimization.