The reason that element swaps in Quicksort shouldbe correlated with running time is (at least) two-fold: element swaps incur not only read accesses but also write accesses (thereby making them more expensive than read-only operations like comparisons), and element swaps in Quicksort are correlated with branch mispredictions during the partition procedure of the algorithm.