Update 6.quickSort.md (hustcc#6)

wagnlinzh · hustcc · commit 29392413f04d · 2017-02-08T15:50:29.000+08:00
* Update 6.quickSort.md

update &#22522;&#20110;&#20005;&#34074;&#25935;&#29256;&#30340;js&#24555;&#25490;, C++&#29256;.&#20248;&#21270;&#25481;swap&#30340;&#25805;&#20316;

* Update 6.quickSort.md

* update lagyout

&#21780;,&#20854;&#23454;&#25105;&#24819;&#34920;&#36798;&#30340;&#37325;&#28857;&#26159;&#20248;&#21270;&#25481;swap&#36825;&#20010;&#20132;&#25442;,&#36825;&#37324;(swap)&#20250;&#22686;&#21152;&#21516;&#25490;&#24207;&#25968;&#37327;&#32423;(O(nlgn))&#30340;&#27604;&#36739;&#27425;&#25968;&#21644;&#20132;&#25442;&#27425;&#25968;&#25805;&#20316;,&#26377;&#28857;&#28010;&#36153;:)

* Update 6.quickSort.md
diff --git a/6.quickSort.md b/6.quickSort.md
@@ -62,6 +62,31 @@ function swap(arr, i, j) {
     arr[i] = arr[j];
     arr[j] = temp;
 }
+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[high] = arr[low];
+  }
+  arr[low] = pivot;
+  return low;
+}
+
+function quickSort2(arr, low, high) {
+  if (low < high) {
+    let pivot = paritition2(arr, low, high);
+    quickSort2(arr, low, pivot - 1);
+    quickSort2(arr, pivot + 1, high);
+  }
+  return arr;
+}
+
 ```
 
 
@@ -127,3 +152,34 @@ func swap(arr []int, i, j int) {
 	arr[i], arr[j] = arr[j], arr[i]
 }
 ```
+
+## 6. C++&#29256;
+
+
+```C++
+ //&#20005;&#34074;&#25935;&#12298;&#25968;&#25454;&#32467;&#26500;&#12299;&#26631;&#20934;&#20998;&#21106;&#20989;&#25968;
+ Paritition1(int A[], int low, int high) {
+   int pivot = A[low];
+   while (low < high) {
+     while (low < high && A[high] >= pivot) {
+       --high;
+     }
+     A[low] = A[high];
+     while (low < high && A[low] <= pivot) {
+       ++low;
+     }
+     A[high] = A[low];
+   }
+   A[low] = pivot;
+   return low;
+ }
+
+ void QuickSort(int A[], int low, int high) //&#24555;&#25490;&#27597;&#20989;&#25968;
+ {
+   if (low < high) {
+     int pivot = Paritition1(A, low, high); 
+     QuickSort(A, low, pivot - 1);
+     QuickSort(A, pivot + 1, high);
+   }
+ }
+```
