Throwing two eggs from a building. Consider the previous question, but now suppose you only have two eggs, and your cost model is the number of throws. Devise a strategy to determine F such that the number of throws is at most 2VN, then find a way to reduce the cost to ~c VF for some constant c. This is analogous to a situation where search hits (egg intact) are much cheaper than misses (egg broken).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.