数据结构实验之排序八:快速排序
Time Limit: 1000MS Memory Limit: 65536KBProblem Description
给定N(N≤10^5)个整数,要求用快速排序对数据进行升序排列,注意不得使用STL。Input
连续输入多组数据,每组输入数据第一行给出正整数N(≤10^5),随后给出N个整数,数字间以空格分隔。Output
输出排序后的结果,数字间以一个空格间隔,行末不得有多余空格。Example Input
8 49 38 65 97 76 13 27 49Example Output
13 27 38 49 49 65 76 97Hint
Author
#include<stdio.h>
#define N 100001
int partition(int a[], int low, int high)
{
int x = a[low];
while(low < high)
{
while(low < high && a[high] >= x)high--;
a[low] = a[high];
while(low < high && a[low] <= x)low++;
a[high] = a[low];
}
a[low] = x;
return low;
}
void qsort(int a[], int left, int right)
{
int m;
if(left < right)
{
m = partition(a, left, right);
qsort(a, left, m - 1);
qsort(a, m + 1, right);
}
}
int main()
{
int i, a[N], n;
while(scanf("%d", &n) != EOF)
{
for(i = 0; i <= n - 1; i++)
{
scanf("%d", &a[i]);
}
qsort(a, 0, n - 1);
for(i = 0; i <= n - 1; i++)
{
if(i == 0)
{
printf("%d", a[i]);
}
else
{
printf(" %d", a[i]);
}
}
printf("\n");
}
return 0;
}
数据结构实验之排序八:快速排序
最新推荐文章于 2024-08-01 01:30:00 发布