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.

Welcome to the Algorithms and Programming II course project at Fırat University, Technology Faculty, Software Engineering Department. This project involves developing interactive web applications to ...

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

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