PHP Program for Egg Dropping Puzzle | DP-11

<?php
// A Dynamic Programming based PHP 
// Program for the Egg Dropping Puzzle

/* Function to get minimum number
   of trials needed in worst
   case with n eggs and k floors */
function eggDrop($n, $k)
{
    
    /* A 2D table where entry eggFloor[i][j]
       will represent minimum number of 
       trials needed for i eggs and j floors. */
    $eggFloor = array(array());;
    
    // We need one trial for one 
    // floor and0 trials for 0 floors
    for ($i = 1; $i <=$n;$i++)
    {
        $eggFloor[$i][1] = 1;
        $eggFloor[$i][0] = 0;
    }

    // We always need j trials
    // for one egg and j floors.
    for ($j = 1; $j <= $k; $j++)
        $eggFloor[1][$j] = $j;

    // Fill rest of the entries in 
    // table using optimal substructure
    // property
    for ($i = 2; $i <= $n; $i++)
    {
        for ($j = 2; $j <= $k; $j++)
        {
            $eggFloor[$i][$j] = 999999;
            for ($x = 1; $x <= $j; $x++)
            {
                $res = 1 + max($eggFloor[$i - 1][$x - 1], 
                                 $eggFloor[$i][$j - $x]);
                if ($res < $eggFloor[$i][$j])
                    $eggFloor[$i][$j] = $res;
            }
        }
    }

    // eggFloor[n][k] holds the result
    return $eggFloor[$n][$k];
}

    // Driver Code
    $n = 2;
    $k = 36;
    echo "Minimum number of trials in worst case with " .$n. " eggs and "
                                    .$k. " floors is " .eggDrop($n, $k) ;
                                    
// This code is contributed by Sam007
?>