修改快速排序

byhieg · byhieg · commit 93dccc07d7b9 · 2017-04-10T16:23:13.000+08:00
diff --git a/src/main/java/cn/byhieg/algorithmtutorial/Sort.java b/src/main/java/cn/byhieg/algorithmtutorial/Sort.java
@@ -165,14 +165,14 @@ public int partition(int[] nums, int low, int high) {
         int x = nums[i];
         while (i < j) {
             //从右向左找到nums[j]小于x的元素
-            while (i < j && nums[j] > x) j--;
+            while (i < j && nums[j] >= x) j--;
             if (i < j) {
                 nums[i] = nums[j];
                 i++;
             }
 
             //从左向右找到nums[i]大于x的元素
-            while (i < j && nums[i] < x) i++;
+            while (i < j && nums[i] <= x) i++;
             if (i < j) {
                 nums[j] = nums[i];
                 j--;
