手撕快速排序

#include <cstdio>
int arr[]={3,2,1,0,5,6,4,9,11,8};
int oneRound(int arr[],int low,int high)
{
    int key=arr[low];
    while(low<high)
    {
        while(low<high)
        {
            if(arr[high]<key)
            {
                arr[low]=arr[high];
                break;
            }
            high--;
        }
        while(low<high)
        {
            if(arr[low]>key)
            {
                arr[high]=arr[low];
                break;
            }
            low++;
        }
    }
    arr[low]=key;
    return low;
}
void qSort(int arr[],int low,int high)
{
    if(low>=high)
    {
        return;
    }
    int mid=oneRound(arr,low,high);
    qSort(arr,low,mid-1);
    qSort(arr,mid+1,high);
}
int main()
{
    qSort(arr,0,9);
    for(int i=0;i<10;i++)
    {
        if(i>0)
            printf(" ");
        printf("%d",arr[i]);
    }
    printf("\n");
    return 0;
}

欢迎大家关注/订阅我的微信公众号Code Art Online，我会在我的公众号分享个人见闻，发现生活趣味；这里不仅有0和1，还有是诗和远方↓↓↓