Modified Counting Sort

Kumar, Ravin

doi:10.1007/978-981-10-7323-6_21

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Counting sort is a simple, stable and efficient sorting algorithm with linear running time, which is a fundamental building block for many applications [1]. Counting sort is one, which lies in this domain [2].…”

Section: Introductionmentioning

confidence: 99%

Improvement of Counting Sorting Algorithm

Song,

2023

JCC

View full text Add to dashboard Cite

By analyzing the internal features of counting sorting algorithm. Two improvements of counting sorting algorithms are proposed, which have a wide range of applications and better efficiency than the original counting sort while maintaining the original stability. Compared with the original counting sort, it has a wider scope of application and better time and space efficiency. In addition, the accuracy of the above conclusions can be proved by a large amount of experimental data.

show abstract

Section: Introductionmentioning

confidence: 99%