优化快速排序代码

Yuhuiyang-Dev · Yuhuiyang-Dev · commit 9af699d256aa · 2019-03-10T21:25:19.000+08:00
diff --git a/「一入 Java 深似海 」/代码/segmentfault/deep-in-java/stage-2/lesson-4/src/main/java/com/segmentfault/deep/in/java/collection/algorithm/QuickSort.java b/「一入 Java 深似海 」/代码/segmentfault/deep-in-java/stage-2/lesson-4/src/main/java/com/segmentfault/deep/in/java/collection/algorithm/QuickSort.java
@@ -63,22 +63,22 @@ int partition(T[] values, int low, int high) {
         // pIndex = 3
 
         T pivot = values[high];
-        int i = low - 1;
+        int i = low;
 
         for (int j = low; j < high; j++) {
             if (values[j].compareTo(pivot) < 1) { // <=
-                i++; // -1 -> 0
                 T temp = values[i]; // 低位数据
                 values[i] = values[j]; // 低位数据获取高位数据
                 values[j] = temp;
+                i++; // -1 -> 0
             }
         }
 
-        T temp = values[i + 1];
-        values[i + 1] = values[high];
+        T temp = values[i];
+        values[i] = values[high];
         values[high] = temp;
 
-        return i + 1; // 游标+1
+        return i;
     }
 
     public static void main(String[] args) {
