快速排序函数代码

 

void quicksort(int left,int right)
{int i,j,t,temp;
if(left>right)
return;
temp=a[left];
i=left;
j=right;
while(i!=j)
{
    while(a[j]>=temp&&i<j)
    {
        j--;
    }
    while(a[i]<=temp&&i<j)
    {
        i++;
    }
    if(i<j)
    {
        t=a[i];
        a[i]=a[j];
        a[j]=t;
    }
}
a[left]=a[i];
a[i]=temp;
quicksort(left,i-1);
quicksort(i+1,right);
return;
}

 

转载于:https://www.cnblogs.com/Staceyacm/p/10782133.html