Simple-ish Sort

Submit solution

Points: 1
Time limit: 1.0s
Memory limit: 1G

Problem type

Silly Nic, while putting his collection of neatly sorted numbers back on his shelf, he's jumbled several groups of numbers out of order. Can you help Nic sort all \(N\) of his number collections, each into ascending order?

Input Specification

The first line contains a single integer \(N\) - the number of _arrays_ Nic needs sorting.

The next \(N\) lines will contain \(k\) space-separated integers where each number \(a_k\) sits between \(-100\) and \(100\) inclusive.


For all test-cases:

\(1 \leq N \leq 100\)

\(1 \leq k \leq 1000\)

\(-100 \leq a_k \leq 100\)

Output Specification

For each of the \(N\) arrays, output each array as space-separated integers in ascending order on its own line.

Sample Input 1

5 4 3 2 1
-20 3 5 5 0

Sample Output 1

1 2 3 4 5
-20 0 3 5 5


There are no comments at the moment.