quick sort(c++)_quicksort partition c++代码-CSDN博客

本文介绍了使用C++实现快速排序算法的三种方法，包括以左侧元素为基准、以右侧元素为基准和以中间元素为基准的分区策略，并提供了详细的代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

//1 1 4 2 1 3 2 4

class Solution {
public:
//left as pivot
int partition2(vector<int> &arr, int l, int r){
const int low_idx=l, pivot=arr.at(low_idx);
int c_idx=r, pivot_idx=r+1;

while(c_idx>l){
if(arr.at(c_idx)>pivot){
std::swap(arr.at(--pivot_idx), arr.at(c_idx));
}
c_idx--;
}
std::swap(arr.at(pivot_idx-1), arr.at(low_idx));
return pivot_idx-1;
}

//right as pivot
int partition1(vector<int> &arr, int l, int r){
const int high_idx=r, pivot=arr.at(high_idx);
int c_idx=l, pivot_idx=l-1;

while(c_idx<r){
if(arr.at(c_idx)<=pivot){
std::swap(arr.at(++pivot_idx), arr.at(c_idx));
}
c_idx++;
}
std::swap(arr.at(pivot_idx+1), arr.at(high_idx));
return pivot_idx+1;
}

//middle as pivot
int partition(vector<int> &arr, int l, int r){
const int mid_idx=(l+r)/2, pivot=arr.at(mid_idx);
int c_idx=l, pivot_idx=l-1, new_mid_idx=mid_idx;

while(c_idx <= r){
if(arr.at(c_idx)<=pivot){
std::swap(arr.at(++pivot_idx), arr.at(c_idx));
if(c_idx==mid_idx){
new_mid_idx=pivot_idx;
}
}
c_idx++;
}
std::swap(arr.at(pivot_idx), arr.at(new_mid_idx));
return pivot_idx;
}

void quickSort(vector<int> &arr, int l, int r){
if(l<r){
int pivot_idx=partition2(arr,l,r);