快速排序

快速排序

视频教程

#include <bits/stdc++.h>
using namespace std;
void quck_sort(int a[],int l, int r){
    if(l>=r) return ;
    int left = l;
    int right = r;
    int temp = a[left];
    while (left<right){
        while(left<right&&temp<=a[right]){
            right--;
        }
        if(left<right){
            a[left]=a[right];
        }
        while (left<right&&temp>=a[left]){
            left++;
        }
        if(left<right){
            a[right]= a[left];
        }
        a[left] = temp;
    }
    quck_sort(a,l,left-1);
    quck_sort(a,right+1,r);
}
int main(){
    int a[13]={1,5,3,4,8,9,2,2,1,5,4,9,8};
    for(int i = 0;i<13;i++){
        cout<<a[i]<<" "; 
    }
    cout<<endl;
    quck_sort(a,0,12);
    for(int i = 0;i<13;i++){
        cout<<a[i]<<" "; 
    }
    return 0;
}