int cmp(const void* p1, const void* p2)
{
	return *(int *)p1 - *(int *)p2;
}

qsort(output, n, sizeof(int), cmp);

快过：

int Partition(int low,int high)
{
    int cmp;
    cmp = output[low];
    while (low < high)
    {
        while (low < high && output[high] >= cmp) --high;
        output[low] = output[high];
        while (low < high && output[low] <= cmp) ++low;
        output[high] = output[low];     
    }
    output[low] = cmp;
    return low;
}
void QSort(int low, int high)
{
    int pivotloc;
    if (low < high)
    {
        pivotloc = Partition(low, high);
        QSort(low, pivotloc - 1);
        QSort(pivotloc + 1, high);             
    }     
}

QSort(0, n - 1);

• Re:无语，自己写的快排就是没有自带的快，一换qsort就过…… (37) yinyueyouge 2008-03-07 17:25:41
  • 而且相差也太大了！用自带的qsort运行时间是407MS，自己写的快排居然2000MS Timeout。 (469) yinyueyouge 2008-03-07 17:32:52
• Re:无语，自己写的快排就是没有自带的快，一换qsort就过…… (792) anthor 2009-08-05 12:15:13