In that case, he should compare this parallel sorting function to a parallel quicksort and a parallel mergesort. Once one iteration of QC’s partition function

In that case, he should compare this parallel sorting function to a parallel quicksort and a parallel mergesort. Once one iteration of QC’s partition function is run, you have distinct sub-problems on each side of the pivot element. Similarly, mergesort starts out with parallelisable sub-problems; merging collapses the parallelism gradually.