Minimum Number of Swaps to Sort an Array

Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.

Input:

T (number of test cases)
For each test case:
N (size of the array)
ARR (N distinct integers)

Output:

For each test case, output a single integer indicating the minimum number of swaps required to sort the array.

Example:

Given the input array [4, 3, 2, 1], the minimum number of swaps required to sort the array is 2. This can be achieved by swapping index 0 with 3 and 1 with 2, resulting in the sorted array [1, 2, 3, 4].

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ N ≤ 1000
• 0 ≤ ARR[i] ≤ 109

Note that ARR[i] represents the values of the array elements with a time limit of 1 second per test case.