A New Mixed Sorting Method by Grading
Wenming He
Abstract
Wenming He
Abstract
In this paper, based on the comprehensive analysis to classical sorting algorithms, such as bubbling sorting, quick sorting, base sorting , grading sorting and so on, a Improved grading sorting algorithm is presented. And then a new mixed sorting algorithm is proposed . Finally the comparison of numerical experiments for several sorting algorithms are given ,it shows that new sorting algorithm has higher efficiency.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, based on the comprehensive analysis to classical sorting algorithms, such as bubbling sorting, quick sorting, base sorting , grading sorting and so on, a Improved grading sorting algorithm is presented. And then a new mixed sorting algorithm is proposed . Finally the comparison of numerical experiments for several sorting algorithms are given ,it shows that new sorting algorithm has higher efficiency.
Key concepts: Sorting, Sorting algorithm, Sorting network, Computer science, Grading (engineering), Algorithm, Engineering, Civil engineering