add some notes

Author: icodeajk

6.quickSort.md

@@ -51,7 +51,7 @@ function partition(arr, left ,right) {     // 分区操作
         if (arr[i] < arr[pivot]) {
             swap(arr, i, index);
             index++;
-        }        
+        }
     }
     swap(arr, pivot, index - 1);
     return index-1;
@@ -62,7 +62,10 @@ function swap(arr, i, j) {
     arr[i] = arr[j];
     arr[j] = temp;
 }
-function partition2(arr, low, high) {
+
+
+/*方法二：记得有三个参数！
+ function partition2(arr, low, high) {
   let pivot = arr[low];
   while (low < high) {
     while (low < high && arr[high] > pivot) {
@@ -85,7 +88,7 @@ function quickSort2(arr, low, high) {
     quickSort2(arr, pivot + 1, high);
   }
   return arr;
-}
+} */
 
 ```