快速排序出错，找不到问题在哪，求助

Question

#include

void swap(int v[], int i, int j)
{
int temp;
temp = v[i];
v[i] = v[j];
v[j] = temp;
}

void quicksort(int arr[], int low, int high)
{
if (low >= high)
return;
int povit = arr[high];
int i = 0, j = low - 1;
for (i = 0; i < high; i++) //arr[j]始终小于arr【high】
{
if (arr[i] < povit)
swap(arr, i, ++j);
}
swap(arr, ++j, high); //arr[++j]大于povit，所以交换
quicksort(arr, low, j - 1);
quicksort(arr, j + 1, high);
}

int main()
{
int arr[10] = { 6, 1, 2, 7, 9, 3, 4, 5, 10, 8 };
quicksort(arr, 0, 9);
int i;
for (i = 0; i < 10; ++i)
{
printf("%d ", arr[i]);
}
}

Answer 1

void quicksort(int arr[], int low, int high)
{
if (low >= high)
return;
int povit = arr[high];
int i = 0, j = low - 1;

quicksort(arr, low, j - 1);
quicksort(arr, j + 1, high);

for (i = 0; i < high; i++) //arr[j]始终小于arr【high】
{
if (arr[i] < povit)
swap(arr, i, ++j);
}
swap(arr, ++j, high); //arr[++j]大于povit，所以交换

}