快速排序模版,代码如下:
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#define ll long long
using namespace std ;
pair<int,int>partition( vector<int> &a ,int l, int r ){
int less = l-1,more = r ;
while ( l < more ){
if ( a[l] < a[r] ){
swap(a[l++],a[++less]) ;
}
else if ( a[l] > a[r] ){
swap(a[l],a[--more]) ;
}
else{
l ++ ;
}
}
swap(a[more],a[r]) ;
return make_pair(less+1,more);
}
void quickSort(vector<int> &a , int l , int r ){
if ( l < r ){
swap(a[l +rand()%(int)(r-l+1)],a[r]) ;
pair<int,int> p = partition(a,l,r) ;
quickSort(a,l,p.first-1) ;
quickSort(a,p.second+1,r) ;
}
return ;
}
int main(){
vector<int> a ;
int n ;
cin >> n ;
for ( int i = 0 ; i < n ; i ++ ){
int num ;
cin >> num ;
a.push_back(num) ;
}
quickSort(a,0,a.size()-1) ;
for ( int i = 0 ; i < a.size() ; i ++ ){
cout << a[i] << " " ;
}
return 0 ;
}