A New Sorting Algorithm by Grading
Wen‐ming He
Abstract
Wen‐ming He
Abstract
In this paper, based on study of base sorting and its language implementing technology,a new base sorting algorithm is proposed .at last,.a comparison of numerical experiments for new algorithm and other sorting algorithms is given,it shows that the new 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 study of base sorting and its language implementing technology,a new base sorting algorithm is proposed .at last,.a comparison of numerical experiments for new algorithm and other sorting algorithms is given,it shows that the new algorithm has higher efficiency.
Key concepts: Sorting, Sorting algorithm, Algorithm, Computer science, Merge algorithm, Base (topology), Grading (engineering), Mathematics