int quick_sort(int data[], int low, int high)
{
int i = 0;
int j = 0;
int piovt = 0;
if (low < high)
{
piovt = data[low];
i = low;
j = high;
while(i<j)
{
while(i<j && data[j] >= piovt)
{
j--;
}
if (i<j)
{
data[i++] = data[j];
}
while(i<j && data[i] <= piovt)
{
i++;
}
if(i<j)
{
data[j--] = data[i];
}
}
data[i] = piovt;
quick_sort(data,low, i-1);
quick_sort(data, i+1, high);
}
return 0;
}
快速排序算法
最新推荐文章于 2024-09-27 11:50:10 发布