void qsort(int * p , int *q ) //p数组首地址指针,q是数组最后一个数的指针
{
int * low = p ;
int * high = q ;
int key = *p ;
if(q-p>0) //结束条件
{
while(low<high)
{
while(low<high && key <= *high)
high-- ;
*low = *high ;
while(low<high && key>= *low)
low++ ;
*high = *low ;
}
*low = key ;
qsort(p,low-1);
qsort(low+1 ,q) ;
}
}
{
int * low = p ;
int * high = q ;
int key = *p ;
if(q-p>0) //结束条件
{
while(low<high)
{
while(low<high && key <= *high)
high-- ;
*low = *high ;
while(low<high && key>= *low)
low++ ;
*high = *low ;
}
*low = key ;
qsort(p,low-1);
qsort(low+1 ,q) ;
}
}