很高兴为您服务!下面是这段C语言快速排序的代码: void quick_sort(int array[], int left, int right) { int i = left; int j = right; int pivot = array[(left + right) / 2]; int temp;
while (i <= j)
{
while (array[i] < pivot)
i++;
while (array[j] > pivot)
很高兴为您服务!下面是这段C语言快速排序的代码: void quick_sort(int array[], int left, int right) { int i = left; int j = right; int pivot = array[(left + right) / 2]; int temp;
while (i <= j)
{
while (array[i] < pivot)
i++;
while (array[j] > pivot)