I don't see how incremental could be faster because it imposes the same, as well as additional, constraints on the solution compared to all-at-once. In other words, if it were faster to sort ...

If you wanted to show the effects of parallelization on the speed of a sort, and could only pick one algorithm to demonstrate this, which would it be? I have found quite a few that lend themselves to ...