Minimum Swaps 2

  • + 2 comments

    My solution in Python:

    count=0
    
    for x in range(0, len(arr)-1):
        if arr[x]!=x+1:
            b=arr.index(min(arr[x+1:len(arr)]))
            arr[x], arr[b]= arr[b],arr[x]
            count+=1
    
        else:
            continue
    
    return count