The Time Profit Obtained By Parallelization Of Quicksort Algorithm Used For Numerical Sorting

This paper presents an experimental description of how to use OpenMP for achieving high performance from the quicksort algorithm through the parallelization of some key sections of its code. When this work was in process, I was unsure if the time profit I would achieve would be evident, but I think I exceed my expectations in this matter. The only problem I faced was the unpredictability of execution time in some cases for the parallel version. Anyway, even in this case the time profit in comparison with the sequential version was clear and evident.