🐛 fix: 快速排序(#3)

Author: ConardLi

docs/algorithm/排序/快速排序.md

@@ -70,14 +70,14 @@
 
 ```js
     function quickSort(array, start, end) {
-      if (end - start < 2) {
+      if (end - start < 1) {
         return;
       }
       const target = array[start];
       let l = start;
       let r = end;
       while (l < r) {
-        while (l < r && array[r] > target) {
+        while (l < r && array[r] >= target) {
           r--;
         }
         array[l] = array[r];

算法分类/排序/快速排序.md

@@ -62,14 +62,14 @@
 
 ```js
     function quickSort(array, start, end) {
-      if (end - start < 2) {
+      if (end - start < 1) {
         return;
       }
       const target = array[start];
       let l = start;
       let r = end;
       while (l < r) {
-        while (l < r && array[r] > target) {
+        while (l < r && array[r] >= target) {
           r--;
         }
         array[l] = array[r];