快速排序算法
void quicksort(int *arry,int low, int high)
{
int i=low;
int j=high;
int base=arry[low];
if(low >= high)
return;
while(low <high)
{
while(low < high && base <= arry[high])
{
high--;
}
if(base > arry[high])
{
arry[low] = arry[high];
++low;
}
while(low < high && base >= arry[low])
{
low++;
}
if(base < arry[low])
{
arry[high]=arry[low];
--high;
}
}
arry[low]=base;
quicksort(arry,i,low-1);
quicksort(arry,low+1,j);
}
点滴积累,贵在坚持