void quick_sort(int arry[], int lefPosition, int rigPosition)
{
int baseNum;
int first = lefPosition;
int last= rigPosition;
int basePosition = lefPosition;
printf("m %d %d\r\n",lefPosition,rigPosition);
if(lefPosition >=rigPosition)
{
return ;
}
baseNum = arry[basePosition];
while(first < last)
{
for(last = rigPosition; last >first; last--)
{
if(arry[last] < baseNum)
{
arry[first] = arry[last];
break;
}
}
for(first = lefPosition; first < last; first++)
{
if(arry[first] > baseNum)
{
arry[last] = arry[first];
break;
}
}
arry[first] = baseNum;
}
quick_sort(arry,lefPosition,first-1);
quick_sort(arry,first+1,rigPosition);
}
{
int baseNum;
int first = lefPosition;
int last= rigPosition;
int basePosition = lefPosition;
printf("m %d %d\r\n",lefPosition,rigPosition);
if(lefPosition >=rigPosition)
{
return ;
}
baseNum = arry[basePosition];
while(first < last)
{
for(last = rigPosition; last >first; last--)
{
if(arry[last] < baseNum)
{
arry[first] = arry[last];
break;
}
}
for(first = lefPosition; first < last; first++)
{
if(arry[first] > baseNum)
{
arry[last] = arry[first];
break;
}
}
arry[first] = baseNum;
}
quick_sort(arry,lefPosition,first-1);
quick_sort(arry,first+1,rigPosition);
}