Random commentary about Machine Learning, BigData, Spark, Deep Learning, C++, STL, Boost, Perl, Python, Algorithms, Problem Solving and Web Search
Wednesday, December 25, 2013
Egg drops
Given k eggs and n floors in a building, find the minimum number of trials required to determine the lowest floor from which when we drop an egg it does not break. Provide a Dynamic Programming solution.
Shouldn't it be highest floor ?If we start from the lowerst floor , it shouldn't break , if it does , there isn't any reason to believe it won't break from higher floors?
excelent! nice post, thanks
ReplyDeletebest regards karimunjawa jepara
Shouldn't it be highest floor ?If we start from the lowerst floor , it shouldn't break , if it does , there isn't any reason to believe it won't break from higher floors?
ReplyDelete*_*!
ReplyDelete