在quicksort中修改后的分区算法是否在所有情况下都与原算法相同?

The code given in class for QuickSort partitioning procedure had two inner loops with an empty body. Suppose we rewrite these loops by moving the increment/decrement from the test into the body of the loop, and by modifying the initial values of the indexes accordingly. The original and modified partitioning procedures are as follows:The code given in class for QuickSort partition