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

    def flip(end_index):
        left = 0
        right = end_index
        while left < right:
            arr[left], arr[right] = arr[right], arr[left]
            left += 1
            right -= 1

    n = len(arr)
    for size in range(n, 1, -1):
        max_index = 0
        for i in range(1, size):
            if arr[i] > arr[max_index]:
                max_index = i

        if max_index == size - 1:
            continue

        if max_index != 0:
            flip(max_index)

        flip(size - 1)

    return arr