代码如下:
#include <stdio.h>
void swap(int v[], int i, int j)
{
int temp;
temp = v[i];
v[i] = v[j];
v[j] = temp;
}
void qsort(int v[], int left, int right)
{
int i, last;
if (left >= right)
return ;
swap(v, left, (left+right)/2);
last = left;
for (i = left+1; i <= right; i++)
if (v[i] < v[left])
swap(v, ++last, i);
swap(v, left, last);
qsort(v, left, last-1);
qsort(v, last+1, right);
}
int main(int argc, char* argv[])
{
int A[10] = {5, 3, 4, 2, 7, 8, 1, 9, 0, 6};
qsort(A, 0, 9);
int i;
for (i = 0; i < 10; i++)
printf("%d ", A[i]);
printf("\n");
return 0;
}
思路:替换left与(left+right)/2,以v的中间元素为比较元素