override quickSort cpp solution

override quickSort cpp solution

Author: sylucky

6.quickSort.md

@@ -157,31 +157,51 @@ func swap(arr []int, i, j int) {
 
 
 ```C++
- //严蔚敏《数据结构》标准分割函数
- 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) //快排母函数
- {
-   if (low < high) {
-     int pivot = Paritition1(A, low, high);
-     QuickSort(A, low, pivot - 1);
-     QuickSort(A, pivot + 1, high);
-   }
- }
+void exchangeVecValue(vector<int>::iterator t1, vector<int>::iterator t2)
+{
+  int temp = *t1;
+  *t1 = *t2;
+  *t2 = temp;
+}
+//快速排序分区函数
+int QuickSortPart(vector<int> *vec, int left, int right)
+{
+  int pivot = left;
+  int index = pivot + 1;
+
+  for (int i = left + 1; i < right; i++)
+  {
+    if ((*vec)[i] < (*vec)[pivot])
+    {
+      exchangeVecValue((*vec).begin()+i, (*vec).begin()+index);
+      index++;
+    }
+  }
+  index--;
+  exchangeVecValue((*vec).begin() + pivot, (*vec).begin() + index);
+
+  return index;
+}
+//快速排序递归函数
+void QuickSortA(vector<int> *vec, int left, int right)
+{
+  if(right>left)
+  {
+    //patition分区
+    int pivot = QuickSortPart(vec, left, right);
+    //左排序
+    QuickSortA(vec, left, pivot - 1);
+    //右排序
+    QuickSortA(vec, pivot + 1, right);
+  }
+}
+
+//快速排序母函数
+vector<int> AlgorithmSort::QuickSort(vector<int> vec)
+{  
+  QuickSortA(&vec,0,vec.size()-1);
+  return vec;
+}
 ```
 
 ## 7. Java 代码实现