[TIL 23] 퀴즈 2750번

number_of_numbers = int(input())
nums = [int(input()) for i in range(number_of_numbers)]

def mergeSort(x):
    if len(x) > 1:
        mid_point = len(x)//2
        left_x = x[:mid_point]
        right_x = x[mid_point:]

 

        mergeSort(left_x)

        mergeSort(right_x)

 

        left_index, right_index, x_index = 0, 0, 0
        while left_index < len(left_x) and right_index < len(right_x):
            if left_x[left_index] < right_x[right_index]:
                x[x_index] = left_x[left_index]
                left_index += 1
            else:
                x[x_index] = right_x[right_index]
                right_index += 1
            x_index += 1