> 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);