Implementation of ARU-Counting-Sort in Python, as in the paper by A.R. Usmani(2019).
The implementation can be found in aru_counting_sort.py. The comparison between normal counting sort and quick sort can be seen in sort_comparison.ipynb.
References: A. R. Usmani, "A Novel Time and Space Complexity Efficient Variant of Counting-Sort Algorithm," 2019 International Conference on Innovative Computing (ICIC), 2019, pp. 1-6, doi: 10.1109/ICIC48496.2019.8966717.