Selection Sort Problem Statement

Implement the Selection Sort algorithm to sort an unsorted array of non-negative integers in non-decreasing order. The algorithm should repeatedly find the minimum element from the unsorted part of the array and place it at the beginning of the unsorted region.

Example:

Input:

T = 1
N = 9
Array = 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:

The sorting should be done in place, updating the given array directly. You do not need to print anything; just implement the given function.