![sammiirene](/avatars/39951.jpg)
sammiirene
19.09.2019 •
Computers and Technology
What makes for a good algorithm compatibility complexity humor correctness efficiency?
Solved
Show answers
More tips
- S Style and Beauty How to Get Rid of Under Eye Bruises?...
- F Food and Cooking Is Bacon Good for You?...
- S Style and Beauty Discover the Art of Nail Design: How Do You Paint Your Nails?...
- P Philosophy How to Develop Extrasensory Abilities?...
- O Other Everything You Need to Know About Kudyabliks...
- C Computers and Internet The Twitter Phenomenon: What it is and How to Use it...
- C Computers and Internet How to Choose a Laptop: Expert Guide and Tips...
- C Computers and Internet How to Choose a Monitor?...
- H Horoscopes, Magic, Divination Where Did Tarot Cards Come From?...
- S Style and Beauty How to Make Your Lips Fuller? Ideas and Tips for Beautiful Lips...
Answers on questions: Computers and Technology
- H Health Can someone tell me the best way to pull out baby teeth? you in advance....
- E English Does she earned many young readers make sense?...
- H History How can i put this = how shall goods be produced= in my own words?...
- M Mathematics Adam is building birdhouses that require 1/2 -ft- long boards. how many pieces that are exactly 1/2 ft long can be made from a board that is 8 1/4 ft long? show your work...
Ответ:
Ответ:
We will use the following approach to solve the problem:
Explanation:
1. We will identify the largest pancake in the given stack of pancakes, then insert the spatula below that pancake and flip the entire stack consisting of that largest identified pancake and all other pancakes on the top of it. Now the largest pancake will be on the top of the stack. Now insert the spatula at the bottom of stack and flip. In this way the largest pancake will become the bottommost pancake.
Now identify the next second largest pancake and repeat above process, keep on relating that until all are sorted.
This requires almost 2n-3 flips in worst case. ( For n pancakes). So the time complexity is O(n)
2n because one flip is required to bring pancake at top, then in 2nd flip it goes to bottom.
-3 because, the stack becomes sorted once the 2nd last pancake comes to the top. So next three steps are never required.
B) we want to find stack of n pancakes, that take omega (n) steps.
For that to happen, in worst case ( 2n-3 )>= cn , taking c=1
2n-3 >= n , => n >=3
So for n greater than or equal to 3 the condition holds.