def sort_array(arr):
n = len(arr)

for i in range(n):
    while arr[i] != i + 1:
        correct_index = arr[i] - 1
        arr[i], arr[correct_index] = arr[correct_index], arr[i]

return arr

,,,
too slow
I want something more efficient.
I also want to know if it’s the right algorithm.
,,,