Since counting sort becomes efficient when there are many duplicates, the naive approach would be to separate each digit of the ID code. Turns out that in 10 million idCodes, there are way too many ...

This is not the most optimal sorting algorith, but this assignment was to learn how OpenMP works. The count_sort function uses OpenMP to parallelize the sort. Build the code with make on Unix like ...