题目描述
Problem Description
These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights.
Give you some integers, your task is to sort these number ascending (升序).
You should know how easy the problem is now!
Good luck!
Input
Input contains multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow. Each test case contains an integer N (1<=N<=1000 the number of integers to be sorted) and then N integers follow in the same line.
It is guarantied that all integers are in the range of 32-int.
Output
For each case, print the sorting result, and one line one case.
Sample Input
2
3 2 1 3
9 1 4 7 2 5 8 3 6 9
Sample Output
1 2 3
1 2 3 4 5 6 7 8 9
问题分析
直接用排序算法既可,下面的代码使用的是快速排序~
AC代码
# include<stdio.h>
#define MAX 1010
int data[MAX];
int Partition(int *a,int left,int right);
void Qsort(int *a,int left,int right);
int main()
{
int T,i,j;
scanf("%d",&T);
while(T--)
{
int num;
scanf("%d",&num);
for(i=0;i<num;i++)
scanf("%d",&data[i]);
Qsort(data,0,num-1);
for(i=0;i<num-1;i++)
printf("%d ",data[i]);
printf("%d\n",data[num-1]);
}
return 0;
}
void Qsort(int *a,int left,int right)
{
if(left>=right)
return ;
else
{
int r=Partition(a,left,right);
Qsort(a,left,r-1);
Qsort(a,r+1,right);
}
}
int Partition(int *a,int left,int right)
{
int r0=a[left];
int i=left,j=right;
while(i<j)
{
while(a[j]>=r0&&i<j) j--;
a[i]=a[j];
while(a[i]<=r0&&i<j) i++;
a[j]=a[i];
}
a[i]=r0;
return i;
}