计算在给定范围内具有重复元素的数组排序所需的最小交换的算法？

def min_swaps_to_sort(arr):
    n = len(arr)
    pos = {v: i for i, v in enumerate(arr)}
    swaps = 0
    
    for i in range(n):
        # 如果当前元素不在正确的位置上
        if arr[i] != sorted(arr)[i]:
            # 找到应该在当前位置的元素
            correct_val = sorted(arr)[i]
            correct_pos = pos[correct_val]
            
            # 交换元素
            arr[i], arr[correct_pos] = arr[correct_pos], arr[i]
            
            # 更新位置字典
            pos[arr[correct_pos]] = correct_pos
            pos[arr[i]] = i
            
            swaps += 1
    
    return swaps

# 示例
arr = [4, 3, 2, 1, 4]
print("Minimum swaps required:", min_swaps_to_sort(arr))