PROGRAMMING:N-number sorting
###Title Description
Give you n integers, please output from small to large.
###Input Description:
The first is an integer k, which means there are k groups of data.
Then there are k groups of data separated by carriage return. Each group of data starts with an integer n (1 < n < 100), which indicates the number of integers contained in the group of data, and then n integers separated by spaces.
###Output Description:
Each group of data is output from small to large according to the requirements. There is a space between integers in the group, and carriage return is used to separate groups.
###Requirements
Please use what you have learned to program with pointer technology.
###Input sample
```in
three
6 1 5 4 3 2 0
5 8 5 2 10 3
2 2 2
```
####Output sample
```out
0 1 2 3 4 5
2 3 5 8 10
2 2
```
answer：If there is no answer, please comment
Give you n integers, please output from small to large.
###Input Description:
The first is an integer k, which means there are k groups of data.
Then there are k groups of data separated by carriage return. Each group of data starts with an integer n (1 < n < 100), which indicates the number of integers contained in the group of data, and then n integers separated by spaces.
###Output Description:
Each group of data is output from small to large according to the requirements. There is a space between integers in the group, and carriage return is used to separate groups.
###Requirements
Please use what you have learned to program with pointer technology.
###Input sample
```in
three
6 1 5 4 3 2 0
5 8 5 2 10 3
2 2 2
```
####Output sample
```out
0 1 2 3 4 5
2 3 5 8 10
2 2
```
answer：If there is no answer, please comment