-3
这应该是一个快速排序算法的实现。但是当我运行它时,它会一直持续下去而不显示任何东西。我试图找到问题,但现在太累了。请帮忙。快速排序程序不工作?
#include <stdio.h>
void quicksort(int arr[], int pivotIndex,int right);
int partition(int a[],int left,int right);
int main()
{
int arr[5] = {5, 4,2, 3, 6};
int left = 0;
int right = 4;
quicksort(arr, left, right);
for (int i = 0; i < 5; i++)
{
printf("%d ", arr[i]);
}
return 0;
}
void quicksort(int arr[], int left,int right)
{
if (left < right)
{
int pivotNewIndex = partition(arr, left, right);
quicksort(arr, left, pivotNewIndex - 1);
quicksort(arr, pivotNewIndex + 1, right);
}
}
int partition(int a[],int left,int right)
{
int i = left;
int j = right;
int pivotIndex = left;
int temp;
while (i < j)
{
while (a[pivotIndex] <=a[j])
{
j--;
}
if (a[pivotIndex] > a[j])
{
temp = a[pivotIndex];
a[pivotIndex] = a[j];
a[j] = temp;
pivotIndex = j;
}
while (a[pivotIndex] <= a[j])
{
i++;
}
if (a[pivotIndex] < a[j])
{
temp = a[pivotIndex];
a[pivotIndex] = a[j];
a[j] = temp;
pivotIndex = i;
}
}
return pivotIndex;
}
感谢这个完美工作。 – user2279543