您的位置:首页 > 编程语言

快速排序代码

2014-06-06 14:53 169 查看
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

void swap(int *a, int *b)
{
int t = *a;
*a = *b;
*b = t;
}

int partition(int a[], int nLeft, int nRight)
{
int v = a[nRight];
int i = nLeft - 1;
int j = nRight;
for (;;)
{
while (a[++i] < v);

while (a[--j] > v)
if(j == nLeft)
break;

if (i >= j)
break;
swap(&a[i], &a[j]);
}
swap(&a[i], &a[nRight]);
return i;
}

void quick_sort(int a[], int nLeft, int nRight)
{
if (nRight <= nLeft)
return;
int i = partition(a, nLeft, nRight);
quick_sort(a, nLeft, i - 1);
quick_sort(a, i + 1, nRight);
}

int print_array(int a[], int nLen)
{
for(int i = 0; i < nLen; i++)
{
printf("%d ", a[i]);
}
printf("\n");
}

int main(void)
{
srand((unsigned)time(NULL));
int a[10];
for (int i = 0; i < 10; i++) {
a[i] = rand() % 10;
}
printf("排序前:\n");
print_array(a, 10);
quick_sort(a, 0, 9);
printf("排序后:\n");
print_array(a, 10);
return 0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: