#include
void quicksort(int array[], int min, int max);
int partition(int array[],int min, int max)
{
int p;
p = array[min];
//int len = max;
while (min < max)
{
while (array[max] >= p && min < max)
{
max--;
}
array[min] = array[max];
while (array[min] <= p && min < max)
{
min++;
}
array[max] = array[min];
}
array[min] = p;
//printf("分界：%d\n", min);
for (int i = 0; i <=11; i++)
{
printf("%d ", array[i]);
}
printf("\n");
return min;
}
void quicksort(int array[], int min, int max,int n)
{
int p;
n++;
printf("第%d次递归:", n);
p = partition(array, min, max);
if (min < max)
{
quicksort(array, min, p-1,n);
//partition(array, p+1 , max);
quicksort(array, p+1, max,n);
}
}
int main()
{
int arr[] = { 5, 9, 2, 7, 8, 3,1,4, 11, -10, 10, 0 };
//printf("%d\n", sizeof(arr) / sizeof(arr[0]));
int min = 0;
int max = sizeof(arr) / sizeof(arr[0]) - 1;
//int p = partition(arr, min, max);
//printf("min的值为：%d\n", min);
//partition(arr, min, p);
quicksort(arr, min, max,0);
return 0;
}
