SortBinary.java

//sort binary(only 0 and 1) array in linear time:


import java.util.Arrays;
 
class SortBinary
{
    // Function to sort a binary array in linear time
    public static void sort(int[] A)
    {
        // count number of 0's
        int zeros = 0;
        for (int value: A)
        {
            if (value == 0) {
                zeros++;
            }
        }
 
        // put 0's at the beginning
        int k = 0;
        while (zeros-- != 0) {
            A[k++] = 0;
        }
 
        // fill all remaining elements by 1
        while (k < A.length) {
            A[k++] = 1;
        }
    }
 
    public static void main (String[] args)
    {
        int[] A = { 0,1,1,0,1,0,0};
 
        sort(A);
 
        // print the rearranged array
        System.out.println(Arrays.toString(A));
    }
}