BinarySearch ? On Mon, Feb 7, 2011 at 3:29 PM, snehal jain <[email protected]> wrote: > You are given a no. of identical balls and a building with N floors. > you know that there is an integer X< N such that ball will break if it > is dropped from any floor X or higher but it will remain intact if > dropped from a floor below X. > Given K balls and N floors, what is the minimum no. of ball drops that > are required to determine X in the worst case? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > >
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
