经典排序之快排数组模拟快排

#include <stdio.h>

int partition(int *a,int low ,int high)
{
    int privotpos;
    int tem = a[low];
    privotpos = a[low];
    while(low<high)
    {
        while(low<high && a[high]>=privotpos)high--;
        a[low] = a[high];
        while(low<high && a[low]<=privotpos)low++;
        a[high] = a[low];
    }
    a[low] = tem;
    return low;
}

void sort(int *a,int low,int high)
{
    int privotpos;
    if(low<high)
    {
        privotpos = partition(a,low,high);
        sort(a,low,privotpos-1);
        sort(a,privotpos+1,high);
    }
}

int main()
{
    int i,*p;
    int length;
    int a[12];
//    length = a.length();
    length = 10;
    printf("Enter 10 numbers:\n");
    for(i = 0; i < length; i++)
//    scanf("%d",(a+i));
    scanf("%d",&a[i]);

    printf("Before ordered:\n");
    for(i = 0; i < length; i++)
    printf("%d ",*(a+i));
    printf("\n\n");
//  quick sort
//    p = a;
    sort(a,0,length-1);

    printf("After ordered:\n");
    for(i = 0; i < length; i++)
    printf("%d ",*(a+i));
    printf("\n");
    return 0;
}

快排原理，每次找一个标志位，然后遍历数组，大于该位的放在其前边，小于该位的放于其后边，然后在对两侧的小数组进行便如此计算，知道排好序为止。代码如上。