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

Authors

23

  1. NF
    Neetu Faujdar

    GLA University, India

    2 publications · 30 citations

    2

    h-index

  2. SO
    Stefan Ohrhallinger

    TU Wien, Austria

    1 publications · 65 citations

    1

    h-index

  3. SG
    SatyaPrakash Ghrera

    Jaypee University of Information Technology, India

    1 publications · 17 citations

    1

    h-index

  4. AA
    Aishy Amer

    Concordia University, Canada

    1 publications · 19 citations

    1

    h-index

  5. KJ
    K. J. Bowers

    Los Alamos National Laboratory, United States

    1 publications · 57 citations

    1

    h-index

1–5 of 23

Venues

  1. SSRN Electronic Journal

    Repository · 1 publications · 27 citations

    1

    h-index

  2. Journal of Computational Physics

    1 publications · 57 citations

    1

    h-index

  3. Indian Journal of Science and Technology

    1 publications · 17 citations

    1

    h-index

  4. 1

    h-index

  5. Information Systems

    1 publications · 47 citations

    1

    h-index

1–5