1. Other
  2. Other
  3. algorithms you have to make pancakes using a skillet that...

Question: algorithms you have to make pancakes using a skillet that...

Question details

ALGORITHMS:

You have to make 6x4ou7yiV8mtrhofievzGugXD_y7AJqQqdzVUa24 pancakes using a skillet that can only hold two pancakes at a time. Each pancake has to be fried on both sides; frying one side of a pancake takes 1 minute, regardless of whether one or two pancakes are fried at the same time. Design an algorithm to do this job in the minimum amount of time and describe it in words. What is the minimum amount of time as a function of n?

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution