text: Consider all droppings from 1 st floor to kth floor and return the minimum of these values plus 1.
code: for ( x = 1 ; x <= k ; x ++ ) { res = max ( eggDrop ( n - 1 , x - 1 ) , eggDrop ( n , k - x ) ) ; if ( res < min ) min = res ; } return min + 1 ; }