Floor Eggs Recursion Problem

So problem is reduced is n 1 eggs and x 1 floors.

Floor eggs recursion problem.

One of the floors is the highest floor an egg can be dropped from without breaking. You are given two eggs and access to a 100 storey building both eggs are identical. Egg dropping refers to a class of problems in which it is important to find the correct response without exceeding a low number of certain failure states. In this article we are going to implement a c program to solve the egg dropping problem using dynamic programming dp.

You have a 100 story building and two eggs. Recursive equation n eggs k floors getdrops n k given n eggs and k floor building minimum of drops to determine the floor from which egg. The physical properties of the ideal egg is such that it will shatter if it is dropped from floor n n n or above and will have no. If an egg survives a fall then it would survive a shorter fall.

You are given n floor and k eggs. A building has 100 floors. You have to minimize the number of times you have to drop the eggs to find. When you drop an egg from any floor of the building the egg will either break or it will survive the fall.

Egg dropping using recursion problem statement. In a toy example there is a tower of n n n floors and an egg dropper with m m m ideal eggs. If the egg breaks then any greater fall would have broken it as well. Submitted by ritik aggarwal on december 13 2018.

If the egg breaks after dropping from xth floor then we only need to check for floors lower than x with remaining eggs as some floor should exist lower than x in which egg would not break. So problem is reduced to n eggs and k x floors. You are given n floor and k eggs you have to minimize the number of times you have to drop the eggs to find the critical floor where critical floor means the floor beyond which eggs start to break. A broken egg must be discarded.

An egg that survives a fall can be used again. If egg does not break check the floors higher than x floors with all the n eggs are remaining. So the problem reduces to x 1 floors and n 1 eggs. The two egg problem problem.

Let s talk about the 2 egg problem courtesy of interview cake. If an egg is dropped and does not break it is undamaged and can be dropped again.