Magical eggs and tiny floors (aka The Cellphone Drop Testing Problem) You are given m eggs and an n floor building. You need to figure out the highest floor an egg can be dropped without breaking, assuming that (i) all eggs are identical, (ii) if an egg breaks after being dropped from one floor, then the egg will also break if dropped from all higher floors, and (iii) if an egg does not break after being thrown from a certain floor, it retains all of its strength and you can continue to use that egg.

Your goal is to minimize the number of throws.

Describe an algorithm to find the floor from which to drop the first egg.