Faster-Than-Quicksort Integer Sorting

Project information

An attempt at creating an O(n) general sorting algorithm. The result was an O(n + m) runtime algorithm which is ready and waiting to be used on your system today. The full research writeup with an empirical performance analysis can be found at the research repository, while the module is found at the reguler repo.