def pancake_sort(nums):
    def flip(arr, k):
        left = 0
        while left < k:
            arr[left], arr[k] = arr[k], arr[left]
            left += 1
            k -= 1
    
    n = len(nums)
    for size in range(n, 1, -1):
        max_idx = nums.index(max(nums[:size]))
        if max_idx != size - 1:
            if max_idx != 0:
                flip(nums, max_idx)
            flip(nums, size - 1)
    
    return nums