# Binary Array Sorting

Posted: 25 Dec, 2020
Difficulty: Easy

## PROBLEM STATEMENT

#### Input Format :

`````` The first line of input contains an integer ‘T’ denoting the number of test cases.

The next ‘2*T’ lines represent the ‘T’ test cases.

The first line of each test case contains an integer ‘N' denoting the size of the array.

The second line of each test case contains ‘N’ space-separated integers consisting of 0s and 1s as the array elements.
``````

#### Output Format :

``````For each test case, print ‘N’ space-separated integers representing the elements of the sorted binary array in a separate line.

Print the output of each test case in a separate line.
``````

#### Note :

``````You do not need to print anything, it has already been taken care of. Just implement the given function.
``````

``````1. Can you solve this problem in a linear time and constant space?
2. Can you solve this problem in a single traversal only?
``````

#### Constraints :

``````1 <= T <= 50
1 <= N <= 10^4
0 <= arr[i] <= 1

Where ‘T’ is the number of test cases and ‘N’ is the size of the array.

Time Limit: 1 sec
`````` Approach 1

• Initialize an integer variable ‘countZero’:= 0,  It will store the count of zeros in the given array.
• Iterate over the given array, if the current element is 0 then increment ‘countZero’ by 1.
• Run a loop where ‘i’ ranges from ‘0’ to ‘n-1’.  If  ‘i’ < ‘countZero’ then place 0  at that index in the given array, otherwise place 1.
• Return this array.

Note -: Instead of counting 0 we can also count 1 in the given array and similarly solve this problem.