Question

A number of different sized pancakes are stacked. A sorted pancake stack is defined as having the smallest pancake on top, the second smallest pancake under the smallest pancake, etc. The only tool provided is a spatula that will flip any top partition of the stack, including the entire stack. Note that there only ever exists one stack of pancakes, not multiple smaller, independent stacks.

Assume that an arbitrary stack of n pancakes is represented as a Python list of numbers, with each number representing the size of the pancake. When sorted, the smallest pancake (with the smallest number) will be at index 0 in the list, and the largest pancake will be at index n – 1. Write a Python function named pancakeSort that expects one argument, a possibly unsorted list of numbers representing pancakes. that uses the flipping technique described above to sort the list. rger pancakes may be on top of smaller pancakes and vice versa.

Answer 1