void QuickSort_Core(vector<int> &A, int Left, int Right){if(Left>=Right) {return;}int pivot = A[0]; int i=Left;int j=Right-1;while(1){while(A[++i] < pivot){}   //从左往右扫，碰到大于pivot的值，就记录下来while(A[--j] > pivot){}   //从右往左扫，碰到小于pivot的值，就记录下来if(i<j){        //如果没有扫完整个数组就停下，说明有值需要交换swap(A[i],A[j]);        }else{break;}}swap(A[i],A[Right-1]);  //把pivot插入指针i，j相遇点QuickSort_Core(A,Left,i-1);QuickSort_Core(A,i+1,Right);
}
int main(){vector<int> A = {};int N = A.size();Quick_Sort(A,0,N-1);cout<<"{"; return 0;
}

int Median3(vector<int> &A, int Left, int Right){int center = (Left+Right)/2;if(A[Left] > A[center]){        //两两比较，将三个数排序swap(A[Left],A[center]);}if(A[center] > A[Right]){swap(A[Right],A[center]);}if(A[Left] > A[center]){swap(A[Left],A[center]);}swap(A[center],A[Right-1]);    //取出中间那个并和最右边倒数第二个调换位置，这样只需要考虑Left+1到Right-2之间的排序return A[Right-1];  //返回值当作pivot
}

#include <iostream>
#include <vector>using namespace std;
void swap(int &A,int &B){int temp = B;B = A;A = temp;
}int Median3(vector<int> &A, int Left, int Right){int center = (Left+Right)/2;if(A[Left] > A[center]){        //两两比较，将三个数排序swap(A[Left],A[center]);}if(A[center] > A[Right]){swap(A[Right],A[center]);}if(A[Left] > A[center]){swap(A[Left],A[center]);}swap(A[center],A[Right-1]);    //取出中间那个并和最右边倒数第二个调换位置，这样只需要考虑Left+1到Right-2之间的排序return A[Right-1];
}void QuickSort_Core(vector<int> &A, int Left, int Right){if(Right-Left>=threshold){   //满足就快排if(Left>=Right) {return;}int pivot = Median3(A, Left, Right); //此时数组的最左边和最右边的值已经确定，不需要再考虑int i=Left;int j=Right-1;while(1){while(A[++i] < pivot){}   //从左往右扫，碰到大于pivot的值，就记录下来while(A[--j] > pivot){}   //从右往左扫，碰到小于pivot的值，就记录下来if(i<j){        //如果没有扫完整个数组就停下，说明有值需要交换swap(A[i],A[j]);        }else{break;}}swap(A[i],A[Right-1]);  //把pivot插入指针i，j相遇点QuickSort_Core(A,Left,i-1);QuickSort_Core(A,i+1,Right);}void Quick_Sort(vector<int> &A, int N){QuickSort_Core(A, 0, N-1);}else{   //不满足就插入排序Insert_Sort(A[remainingpart],Right-Left+1);}
}int main(){vector<int> A = {};int N = A.size();Quick_Sort(A,N);cout<<"{";for(auto e:A){cout<<e<<",";
}cout<<"}";    return 0;
}