sort binary array in linear time

sort_binary_array.py

nums = [0, 0, 1, 0, 1, 1, 0, 1, 0, 0]     # change the array here
i,j=0,len(nums)-1
zeroes, ones = 0,0
flag=0
while i<=j:
  if nums[i]==0:
    zeroes+=1
  else:
    ones+=1

  if nums[j]==0:
    zeroes+=1
  else:
    ones+=1
  i+=1
  j-=1  

j=i+1

while 1:
  if flag == 2: break
  nums[i]=0
  nums[j]=1
  i-=1
  j+=1
  if i<0: flag+=1
  if j>=len(nums)-1: flag+=1

print(nums)