Sort a given binary array

Given an array of 0s and 1s which is indicate binary number. Our goal is to sort this array in effective manner. For example.

  Before Sort :
  0  1  1  0  1  0  1  1  0  1
  After Sort :
  0  0  0  0  1  1  1  1  1  1

Write an algorithm which is sort the binary array only once execute the loop. Here includes some effective solution.

1) Sort binary array using one traversal in java 2) Sort binary array using one traversal in c++ 3) Sort binary array using one traversal in c 4) Sort binary array using one traversal in c# 5) Sort binary array using one traversal in php 6) Sort binary list using one traversal in python 7) Sort binary array using one traversal in ruby 8) Sort binary array using one traversal in scala 9) Sort binary array using one traversal in swift 10) Sort binary array using one traversal in kotlin 11) Sort binary array using one traversal in node js 12) Sort binary array using one traversal in vb.net 13) Sort binary array using one traversal in golang 14) Sort binary array using one traversal in typescript