EggDropping.java

packagecom.thealgorithms.dynamicprogramming;

/**
 * DynamicProgramming solution for the Egg Dropping Puzzle
 */
publicfinalclassEggDropping {
privateEggDropping() {
 }

// min trials with n eggs and m floors
publicstaticintminTrials(intn, intm) {
int[][] eggFloor = newint[n + 1][m + 1];
intresult;
intx;

for (inti = 1; i <= n; i++) {
eggFloor[i][0] = 0; // Zero trial for zero floor.
eggFloor[i][1] = 1; // One trial for one floor
 }

// j trials for only 1 egg
for (intj = 1; j <= m; j++) {
eggFloor[1][j] = j;
 }

// Using bottom-up approach in DP
for (inti = 2; i <= n; i++) {
for (intj = 2; j <= m; j++) {
eggFloor[i][j] = Integer.MAX_VALUE;
for (x = 1; x <= j; x++) {
result = 1 + Math.max(eggFloor[i - 1][x - 1], eggFloor[i][j - x]);

// choose min of all values for particular x
if (result < eggFloor[i][j]) {
eggFloor[i][j] = result;
 }
 }
 }
 }

returneggFloor[n][m];
 }

publicstaticvoidmain(String[] args) {
intn = 2;
intm = 4;
// result outputs min no. of trials in worst case for n eggs and m floors
intresult = minTrials(n, m);
System.out.println(result);
 }
}