Sort a list efficiently which contains only 0 and 1 without using any builtin python sort function?
<p>What is the most efficient way to sort a list, <code>[0,0,1,0,1,1,0]</code> whose elements are only <code>0</code> &amp; <code>1</code>, without using any builtin <code>sort()</code> or <code>sorted()</code> or <code>count()</code> function. O(n) or less than that</p>
