Selection Sort Algorithm

Selection sort is a sorting technique that works by repeatedly finding the minimum element (considering ascending order) from the unsorted part and placing it at the beginning of the unsorted region.

Given an unsorted array of N non-negative integers, your task is to sort the array in non-decreasing order using the Selection Sort algorithm.

Input:

The first line of input contains an integer 'T' representing the number of test cases. 
Each test case consists of two lines: 
The first line contains an integer 'N' denoting the size of the array. 
The second line contains 'N' single space-separated integers representing the array elements.

Output:

The output for each test case should be the array sorted in non-decreasing order, all in one line.

Example:

Input:
1
9
29 72 98 13 87 66 52 51 36
Output:
13 29 36 51 52 66 72 87 98 

Constraints:

• 1 <= T <= 100
• 1 <= N <= 100
• 1 <= Arr[i] <= 1000

Note:

You do not need to print anything, and it has already been taken care of. Just implement the given function. Also, you need to update the given array in place only.