Question

javascript, Given an array of binary digits, 0 and 1, sort the array so that all zeros are at one end and all ones are at the other. Which end does not matter. To sort the array, swap any two adjacent elements. Determine the minimum number of swaps to sort the array.

Answer 1

Answer:

# Python Code:-

def minMoves(list1):

list2=[]

n=len(list1) # Length of list.

for i in range(n):

list2.append(list1[i])

 

#Counting number of swaps when 0 is left side and 1 is right side.

count1=0

for i in range(0,n-1):

for j in range(0,n-i-1):

if list1[j]>list1[j+1]:

count1+=1

list1[j],list1[j+1]=list1[j+1],list1[j]

#Counting number of swaps when 1 is left side and 0 is right side.

count2=0

for i in range(0,len(list2)-1):

for j in range(0,len(list2)-i-1):

if list2[j]<list2[j+1]:

count2+=1

list2[j],list2[j+1]=list2[j+1],list2[j]

return min(count1,count2)

def main():

num=int(input())

list1=[]

for i in range(0,num):

temp=int(input())

list1.append(temp)

min_swap= minMoves(list1)

print("Output : ",min_swap)

if _name=="main_":

main()

Output: