Question: Write a pseudo code and perform algorithm analysis to show the complexity is Log N?
Throwing eggs from a building. Suppose that you have an N-story building and plenty of eggs. Suppose also that an egg is broken if it is thrown off floor F or higher, and unhurt otherwise.
First, devise a strategy to determine the value of F such that the number of broken eggs is ~lg N when using ~lg N throws, and then find a way to reduce the cost to ~2lg F
Can someone provide the answer with reference to algorithm?