Eggs And Floors Dynamic Programming Java

If egg breaks we one by one try remaining 13 floors.

Eggs and floors dynamic programming java.

Two cases arise 1 if egg breaks we have one egg left so we need three more trials. Like other typical dynamic programming dp problems recomputations of same subproblems can be avoided by constructing a temporary array eggfloor in bottom up manner. Given 2 eggs and k floors find the minimum number of trials needed in worst case. Java programming egg dropping puzzle dynamic programming description of instance of this famous puzzle involving n 2 eggs and building with k 36 floors the following is a description of the instance of this famous puzzle involving n 2 eggs and a building with k 36 floors.

This problem is a specific case of n eggs and k floors. So egg dropping puzzle has both properties see this and this of a dynamic programming problem. If egg doesn t break we go to 27th floor. Play safe and drop from floor 1 if egg does not break then drop from floor 2 and so on.

If egg doesn t break on 27 th floor we go to 39 th floor. Base cases eggs 1 floors x. 4 we first try from 4 th floor. K 10 output.

Wiki for dynamic programming. The optimal number of trials is 14 in worst case. So in worst case x times an egg needs to be dropped to find the solution. See below for programming solution for general k eggs and n floors.

N eggs k floors. Try dropping an egg from each floor from 1 to k and calculate the minimum number of dropping needed in worst case. The problem is not actually to find the critical floor but merely to decide floors from which eggs should be dropped so that total number of trials are minimized.