快排

void qsort(int l,int r)//快排
{
    int i=l,j=r;
    node mid,t;
    mid=b[(l+r)>>1];
    while (i<=j)
    {
        while (b[i].x<mid.x) i++;
        while (b[j].x>mid.x) j--;
        if (i<=j)
        {
            t=b[i];b[i]=b[j];b[j]=t;
            i++;j--;
        }
    }
    if (l<j) qsort(l,j);
    if (i<r) qsort(i,r);
}