CPP 1373 Easy as A + B (Bubble Sorting)

CPP 1373 Easy as A + B (Bubble Sorting)

 

Question:

 

Easy as A + B
Time Limit: 1000 MS Memory Limit: 32768 K

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 refreshing waking nights. give you some integers, your task is to sort these number ascending. you shoshould 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 32bit-int.Output: For each case, 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

Question:

A Bubble sorting method sets the information written by others. It is wrong. You can write it yourself later.

 

Code:

 

#include 
 
  int main() {   int temp,t,n;   int store[1005];   scanf(%d,&t);  while(t--)  {    scanf(%d,&n);    for(int i=0;i
  
    store[j])                    {                        temp = store[i];                        store[i] = store[j];                        store[j] = temp;                    }                }            }    printf(%d,store[0]);    for(int i=1;i