update lagyout

唔,其实我想表达的重点是优化掉swap这个交换,这里(swap)会增加同排序数量级(O(nlgn))的比较次数和交换次数操作,有点浪费:)

Author: wagnlinzh

6.quickSort.md

@@ -62,31 +62,30 @@ function swap(arr, i, j) {
     arr[i] = arr[j];
     arr[j] = temp;
 }
-
-//快排2 基于严版改为js版.可以减少swap的操作过程.
-function paritition2(arr,low,high){
-    let pivot=arr[low];
-    while(low<high){
-      while(low<high && arr[high] >pivot){
-        --high;
-      }
-      arr[low]=arr[high];
-      while(low<high && arr[low]<=pivot){
-        ++low;
-      }
-      arr[high]=arr[low];
+functiion paritition2(arr, low, high) {
+  let pivot = arr[low];
+  while (low < high) {
+    while (low < high && arr[high] > pivot) {
+      --high;
+    }
+    arr[low] = arr[high];
+    while (low < high && arr[low] <= pivot) {
+      ++low;
     }
-    arr[low]=pivot;
-    return low;
+    arr[high] = arr[low];
   }
+  arr[low] = pivot;
+  return low;
+}
 
- function quickSort2(arr,low,high){
-    if (low < high) {
-     let pivot = this.paritition2(arr, low, high);
-     this.quickSort2(arr, low, pivot - 1);
-     this.quickSort2(arr, pivot + 1, high);
-   }
-
+function quickSort2(arr, low, high) {
+  if (low < high) {
+    let pivot = this.paritition2(arr, low, high);
+    this.quickSort2(arr, low, pivot - 1);
+    this.quickSort2(arr, pivot + 1, high);
+  }
+  return arr;
+}
 
 ```