CPP 1373 Easy as a+b (bubble sort)

Title Link: http://cpp.zjut.edu.cn/ShowProblem.aspx?ShowID=1373

Surface:

Easy as a+b
Time limit:1000ms Memory limit:32768k

Description:these days, I am thinking on 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 was to sort these number ascending. Should know how easy the problem is now! Good luck!

Input:input contains multiple test cases. The first line of the input was a single integer T which is the number of test cases. T test Cases follow. Each test case contains a integer n (1<=n<=1000 the number of integers to is sorted) and then N integers follow in The same line. It is guarantied, and all integers am in the range of 32bit-int. Output:for, print the sorting result, and one line one case. Sample Input:

23 2 1 39 1 4 7 2 5 8 3 6 9

Sample Output:

1 2 31 2 3 4 5 6 7 8 9

Source:lcy

Exercises

Bubble sort, set down someone else to write, incredibly is wrong, later or write it yourself.

Code:

#include <stdio.h>int main () {   int temp,t,n;   int store[1005];   scanf ("%d", &t);  while (t--)  {    scanf ("%d", &n);    for (int i=0;i<n;i++)     scanf ("%d,", &store[i]);     for (int i = 0, i < n; i++)            {for                (int j = i; J < N; j + +)                {                    if (Store[i] > Store[j])                    {
   temp = Store[i];                        Store[i] = store[j];                        STORE[J] = temp;}}            }    printf ("%d", store[0]);    for (int i=1;i<n;i++)       printf ("%d", Store[i]);     printf ("\ n");  }  return 0;}

CPP 1373 Easy as a+b (bubble sort)