int minimumSwaps(vector<int> arr) {
    
    int i,c=0,n=arr.size();
    for(i=0;i<n;i++)
    {
        if(arr[i]==(i+1))
            continue;
        
        swap(arr[i],arr[arr[i]-1]);
        c++;
        i--;
    }
    return c;

}

def minimumSwaps(arr):
    ref_arr = sorted(arr)
    index_dict = {v: i for i,v in enumerate(arr)}
    swaps = 0
    
    for i,v in enumerate(arr):
        correct_value = ref_arr[i]
        if v != correct_value:
            to_swap_ix = index_dict[correct_value]
            arr[to_swap_ix],arr[i] = arr[i], arr[to_swap_ix]
            index_dict[v] = to_swap_ix
            index_dict[correct_value] = i
            swaps += 1
            
    return swaps

static int minimumSwaps(int[] a) {
        int swap=0;
        for(int i=0;i<a.length;i++){
            if(i+1!=a[i]){
                int t=i;
                while(a[t]!=i+1){
                    t++;  
                }
                int temp=a[t];
                a[t]=a[i];
                a[i]=temp;
                swap++;
            }
        }
        return swap;

    }

# Complete the minimumSwaps function below.
def minimumSwaps(arr,n,swaps=0):
    #iterate over entire array
    for i in range(0,n):
        #it's good practice to use a boolean guided function in a long for loop,
        #while will evaluate and IF the statement in it is true it will continue
        #I used the consecutive, increasing values to swap by index
        while arr[i] != (i+1):
            #temp is the correct index of arr[i]
            temp = arr[i]-1
            #swap this with whatever element is where arr[temp] is, this will
            #continue to swap until arr[i] == index+1
            arr[i], arr[temp] = arr[temp], arr[i]
            #increase swaps
            swaps+=1
    return swaps