user
Task: Reverse engineer the following algorithm and explain its function in one sentence.
Input: def sort_numbers(arr):
    for i in range(len(arr)): 
        for j in range(i): 
            if arr[i] < arr[j]: 
                arr[i], arr[j] = arr[j], arr[i]
    return arr
Output:
assistant
This algorithm sorts numbers in an array in ascending order by comparing them against each other and swapping them if they are out of order.