Counting Sort
Counting Sort is a non-comparative sorting algorithm that organizes elements by counting the number of occurrences of each distinct key value and using arithmetic to determine positions in the output sequence.
10
Publications
289
Citations
23
Authors
10
Institutions
Publications per year
2017–2026
4
Parents
10
A Comparative Study of Various Sorting Algorithms
Sandeep K. Gill, Virendra Singh, Pankaj Sharma et al. · SSRN Electronic Journal · 2018 · 27 citations · Full text
1–5 of 10
23
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 23
10
Amity University
Noida, India
1 h-index
2 publications
26 citations
Institute of Management Technology
Ghaziabad, India
1 h-index
2 publications
20 citations
University of Patras
Pátrai, Greece
1 h-index
3 publications
42 citations
University of California, Berkeley
Berkeley, United States
1 h-index
1 publications
57 citations

Concordia University
Montreal, Canada
1 h-index
2 publications
38 citations

TU Wien
Vienna, Austria
1 h-index
3 publications
195 citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
1 h-index
2 publications
94 citations
Industrial Systems Institute
Pátrai, Greece
1 h-index
1 publications
14 citations
1–8 of 10
Repository · 1 publications · 27 citations
1
h-index
1 publications · 57 citations
1
h-index
1 publications · 17 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 47 citations
1
h-index
1–5