//Here in quick sort, first we do our work of doing the partition and then the recursion function is called to sort, once we are finished. Its opposite to merge sort where first recursion is called. / ...

The Parallel Quick Sort library implements a parallel variant of quick sort which not only performs recursive tasks in parallel but also partitions the input in a parallel manner. The algorithm works ...