Hey everyone, my teacher gave me this problem. Can someone help me please. I can’t find how to start with it.
#Best strategy in worst case scenario
golden heron
next spire
If you had one phone you would have to drop it at every floor up until it breaks
With two, you can drop from every kth floor
The define a function drops(k)=floor(141/k)+k-1
Where you drop phone 1 every k floors
Then when it breaks trace back k floors, and drop k+1, k+2, etc
next spire
But be careful about what the worst case means here