Quick Tally Sort (qtsort) is a linear sorting algorithm that takes O(n) time and O(s) extra space, where s is the range of characters/numbers of the alphabet. It is an implementation of the Counting Sort algorithm. Currently, it has only been implemented to work with char arrays.
License MIT 2016 Ahmad Retha