题目描述
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
Author
lcy
Recommend
We have carefully selected several similar problems for you: 1002 1004 1029 1106 1003
题目来源
http://acm.hdu.edu.cn/showproblem.php?pid=1040
个人思路
1.确定执行次数t
2.确定每次排序的个数n
3.用循环结构输入排序变量
4.采用冒泡排序法排序
5.输出:注意每行最后的换行和数与数之间空格
代码
#include<iostream>
using namespace std;
void sort_array (int a[],int n)
{bool sorted = false;
int t;
while(!sorted){
sorted = true;
for(int i= 1;i<n;i++)
{if(a[i-1]>a[i]){
t = a[i-1];
a[i-1] = a[i];
a[i] = t;
sorted = false;
}
}
n--;
}
}
int main()
{
int t,n,num[1000];
cin>>t;
for(int i = 0;i<t;i++){
cin>>n;
for(int j=0;j<n;j++){
cin>>num[j];
}
sort_array(num,n);
for(int k=0;k<n;k++)
{
if(k==n-1)cout<<num[k];
else cout<<num[k]<<" ";
}
cout<<endl;
}
return 0;
}