先看问题:
己知序列 {503,87,512,61,908,170,897,275,653,462},请给出采用快速排序法对该序列作升序排序时的每一趟结果的答案。
快速排序作业对手写实在不友好,话不多说,上代码
#include <stdio.h>
void my_qsort(int *a, int l, int r, int len)
{
if (l < r)
{
int t = a[l];
int i = l, j = r;
while (i < j)
{
while (a[j] >= t && j > i)
j--;
a[i] = a[j];
while (a[i] <= t && j > i)
i++;
a[j] = a[i];
}
a[i] = t;
printf("key=%d\n", t);
for (int k = 0; k < len; k++)
printf("%d ", a[k]);
printf("\n");
my_qsort(a, l, i - 1, len);
my_qsort(a, i + 1, r, len);
}
}
int main()
{
int a[] = {503, 87, 512, 61, 908, 170, 897, 275, 653, 462};
int len = sizeof(a) / sizeof(int);
my_qsort(a, 0, len - 1, len);
return 0;
}
结果如图