Help me in solving DAA005 problem

help
,
1

My issue

Wrong Answer: Failed on a hidden test case
def selection_sort(arr):
n = len(arr)
for i in range(n):
min_idx = i
for j in range(i+1, n):
if arr[j] < arr[min_idx]:
min_idx = j
arr[i], arr[min_idx] = arr[min_idx], arr[i]
return arr

Sample input

arr = [5, 4, 3, 2, 1]
sorted_arr = selection_sort(arr)
print(sorted_arr)

My code

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

# Sample input
arr = [5, 4, 3, 2, 1]
sorted_arr = selection_sort(arr)
print(sorted_arr)

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