Ultra Radix Sort is an optimized radix sort algorithm designed specifically for sorting large arrays of double values. Unlike comparison-based sorting algorithms that have O (n log n) complexity, this ...

Compile the C file with gcc bucketSortFileInput.c -o bucketsort followed by running python collectResults.py. The program will print out the average run times given 100 samples across the same data.

Abstract: A version of the Byte Radix Sort (BRS) algorithm, which is suitable for the implementation in hardware, is presented. It is shown that hardware implementation eliminates most inefficiencies ...