Help me in solving DAA005 problem

help
,
1

My issue

give me the solution for this code

My code

def selection_sort(arr, n):
    for i in range(n):
        min_val = arr[i]
        min_idx = i
        for j in range(i + 1, n):
            if arr[i] > arr[j]:
                i = arr[j]
                arr[i] = j
        arr[i], arr[j] = arr[j], arr[i]

if __name__ == "__main__":
    n = int(input())

    arr = [int(x) for x in input().split()]

    selection_sort(arr, n)

    for i in range(n):
        print(arr[i], end=" ")

    print()

Learning course: Analysis and Design of Algorithms
Problem Link: Selection Sort in Analysis and Design of Algorithms