def pancake_sort(nums):
    arr = list(nums)

    def flip(k):
        i, j = 0, k
        while i < j:
            arr[i], arr[j] = arr[j], arr[i]
            i += 1
            j -= 1

    n = len(arr)
    for size in range(n, 1, -1):
        max_idx = 0
        for i in range(1, size):
            if arr[i] > arr[max_idx]:
                max_idx = i
        if max_idx == size - 1:
            continue
        if max_idx != 0:
            flip(max_idx)
        flip(size - 1)
    return arr