快排

最新推荐文章于 2022-03-22 09:22:42 发布

codePriest

最新推荐文章于 2022-03-22 09:22:42 发布

阅读量319

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/sinat_28626091/article/details/46288795

版权

算法专栏收录该内容

21 篇文章 0 订阅

订阅专栏

int part(int *x, int p, int q){
    int pivot = x[p];
    int i = p;
    int j = p+1;
    int temp = 0;
    for(j = p+1; j <= q; j++){
        if(x[j] < pivot){
            i++;
            temp = x[i];
            x[i] = x[j];
            x[j] = temp;
        }
    }
    x[p] = x[i];
    x[i] = pivot;
    return i;
}

int quickSort(int *x, int p, int q){
    if(p < q){
        int r = part(x, p, q);
        quickSort(x, p, r-1);
        quickSort(x, r+1, q);
    }
    return 0;
}


int test(void){
    int x[] = {3,2,1,6,3,7,5,1,9,21,97,32,5,4};
    int n = (sizeof x)/4;
    quickSort(x,0,n-1);
    for(int i = 0; i < n; i++)
        cout<<x[i]<<endl;
    return 0;
}