版权声明:未经原作者允许不得转载本文内容,否则将视为侵权 https://blog.csdn.net/springhammer/article/details/88559256
主要功能:实现快速排序法.
#include <stdio.h>
void quick_sort( int *a, int n)
{
int i, j, p, tmp;
if (n < 2) return;
p = a[n / 2];
for ( i = 0, j = n -1;; i++, j--) {
while (a[i] < p)
i++;
while (p < a[j])
j--;
if ( i >= j)
break;
tmp = a[i]; a[i] = a[j]; a[j] = tmp;
}
quick_sort( a, i);
quick_sort( a + i, n - i);
}
int main(void)
{
int a[] = { 2, 5, 7, 3, -1, 1, 4};
int n = sizeof a /sizeof a[0];
int i;
printf("排序前的数为:");
for (i = 0; i < n; i++)
printf("%d%s", a[i], i == n -1 ? "\n" : " ");
quick_sort(a, n);
printf("排序后的数为:");
for (i = 0; i < n; i++)
printf("%d%s", a[i], i == n -1 ? "\n" : " ");
return 0;
}