arr = sorted(arr)

for i in range(len(arr)): arr.insert(find_min(arr[i:]), i)

for i in range(len(arr)): for j in range(len(arr)-i-1): if arr[j] > arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j]

arr = merge_sort(arr)