Minimum swaps to sort an array

Minimum swaps to sort an array.py

def minSwaps(arr, N):

    newArr = [ (arr[i], i) for i in range(len(arr)) ]
    newArr.sort()
    ans = 0
    
    for i in range(len(newArr)):
        j = newArr[i][1]
        
        while newArr[i][1] != newArr[j][1]:
            newArr[i], newArr[j] = newArr[j], newArr[i]
            ans += 1
            j = newArr[i][1]
    
    return ans

1. swaps required to go from initial -> sorted version is same as swaps required from sorted -> initial version
2. sort the array , while keeping track of indices
3. Now indices are unsorted, but can be sorted using cyclic sort
4. sort indices using cyclic sort to get the minimum no. of swaps