快速排序

#include<iostream>
using namespace std;

void qsort(int *arr,int low,int high){
    int i=low;
    int j=high;
    if(i>=j)
        return;
    int tmp=arr[low];
    while(i<j){
        while(i<j&&arr[j]>tmp)
            j--;
        arr[i]=arr[j];
        while(i<j&&arr[i]<tmp)
            i++;
        arr[j]=arr[i];
    }
    arr[i]=tmp;
    qsort(arr,low,i-1);
    qsort(arr,i+1,high);
}
int main(){
    int arr[5]={3,1,2,4,5};
    for(int i=0;i<5;i++){
        cout<<arr[i]<<",";
    }
    cout<<endl;
    qsort(arr,0,4);
    for(int i=0;i<5;i++){
        cout<<arr[i]<<",";
    }
    cout<<endl;
    return 0;
}