2004Natural Science Journal of Xiangtan UniversityRequires access

A New Sorting Algorithm by Grading

Wen‐ming He

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Sorting, Sorting algorithm, Algorithm, Computer science, Merge algorithm, Base (topology), Grading (engineering), Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
A New Sorting Algorithm by Grading — Research Paper | ScholarLens