As mentioned last week, this week I would be working on 2 implementations of Quicksort; one with tasking and one using sections. The goal was to see if OpenMP tasking would perform better compared to sections due to the dynamic, inherently unbalanced, nature of Quicksort, caused by the alternating pivot points. See last week’s post for a more thorough discussion of why tasking may better suited for Quicksort.