#include <iostream>
using namespace std;
//一趟划分,最后将枢轴元素放入low指针指向位置
int Partition(int A[],int low,int high){
int pivot = A[low];
while(low<high){
while(low<high
排序 - 快速排序(C++)
于 2021-08-04 21:53:33 首次发布
#include <iostream>
using namespace std;
//一趟划分,最后将枢轴元素放入low指针指向位置
int Partition(int A[],int low,int high){
int pivot = A[low];
while(low<high){
while(low<high