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.

def _msd_radix_sort(list_of_ints: list[int], bit_position: int) -> list[int]: Sort the given list based on the bit at bit_position. Numbers with a 0 at that position will be at the start of the list, ...

Prograph™ has been briefly described in MacTutor, March 1990. Now that a compiler to produce stand-alone applications is available, I decided to compare the performance with a C implementation. As a ...

Abstract: Every algorithm has its own best-case as well as its worst-case scenario, so it is difficult to determine the best sorting algorithm just by its Big-O. Not only that, the amount of memory ...

Abstract: We focus on the improvement of data locality for the in-core sequential Radix sort algorithm for 32-bit positive integer keys. We propose a new algorithm that we call Cache Conscious Radix ...