Sort an Array of 0s and 1s

Sort an array that contains only 0s and 1s, ensuring that the array is traversed only once to achieve the sorting.

Input:

T = number of test cases
N = size of the array for each test case
A = array containing only 0s and 1s

Output:

The sorted array for each test case, maintaining the order of 0s followed by 1s.

Example:

For the given array:

[0, 1, 1, 1, 0, 0, 1]

The output should be:

[0, 0, 0, 1, 1, 1, 1]

Constraints:

• 1 <= T <= 5
• 1 <= N <= 105
• A[i] = 0 or 1

Note:

The array should be sorted in place, meaning you do not need to return a new array, simply modify the given array.