This is a school project by students of PUC-MG.
We were instructed to implement 4 sorting algorithms (Quicksort, Mergesort and 2 others, of our choosing) with parallelization using OpenMP and test their efficiency.
Run make
After it's done, run ./output < input.txt
If you've run make before, run make clear
Run make debug
After it's done, run gdb debug