A cache-conscious, recursive Radix sort, based on a research paper read for CS 498 - Parallel Programming (Spring 2013) at UIUC.
This is my adaptation of a research paper - http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1183573
There is much room for improvement, and there is not much speedup in this version.
make radixclang will compile using
make clean will remove the binary.
Create a "numbers.txt" file with 1 number per line. Then, run:
./radix [# of lines to sort in the file]