Radix LSD is a sorting algorithm that can sort a set of data with zero comparisons by sorting numbers by their least significant digit (hence LSD) towards their most significant digit. It has a worst-case time complexity of O(w ⋅ n) where n is the number of values, and w is the length of the longest number. Works on any length of number Update 10/11/25 Wrote this in C and was able to sort over 1m items in under 100ms, faster than C++'s std::sort
Use where ever you want, I'm not really fussed about credit. Sorts at ~18,496 items/sec (on my machine. tested with 10000 elements) If you want to know how it works, read this https://en.wikipedia.org/wiki/Radix_sort
