You recursively sort each bucket into subbuckets, and there is a known recursion limit (3 in this case). Here's code for an LSB radix sort, which doesn't recur

You recursively sort each bucket into subbuckets, and there is a known recursion limit (3 in this case). Here's code for an LSB radix sort, which doesn't recurse, but is the same idea: https://github.com/pbiggar/sorting-branches-caching/blob/master/code/sorts/base_radixsort.c https://github.com/pbiggar/sorting-branches-caching/blob/mas...