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: 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 ...

TuGraph-Analytics is a high-performance graph data analysis system that currently utilizes Java's built-in priority queue for sorting, which is primarily based on heap sort. However, when sorting keys ...