1, 快速排序
error code
void sort(int m[], int low, int high)
{
if ( low >= high )
return;
int tmpcompare = m[low];
int lp = low;
int rp = high;
while ( lp < rp )
{
while(m[lp] <= tmpcompare && lp < lp)
lp++;
while(m[rp] > tmpcompare && rp > rp)
rp--;
if (lp >= rp )
break;
swap(m[lp], m[rp]);
}
a[low] = a[rp];
a[rp] = tmpcompare;
sort(m, low, rp);
sort(m, lp, high);
}