NewCodeTemplate

模板/排序/快速排序.cpp

@@ -0,0 +1,27 @@
+#include <vector>
+#include <queue>
+#include <iostream>
+#include <tuple>
+using namespace std;
+
+void quickSort(vector<int>& nums, int l, int r){
+    if(l >= r) return;
+
+    int pivot = nums[l];
+    int i = l, j = r;
+    while(i < j){
+        while(i < j && pivot <= nums[j]) j--;
+        while(i < j && pivot >= nums[i]) i++;
+
+        if(i < j) swap(nums[i], nums[j]);
+    }
+    swap(nums[l], nums[i]);
+    
+    quickSort(nums, l, i - 1);
+    quickSort(nums, i + 1, r);
+}
+
+int main(){
+
+    return 0;
+}