There is a building with 100 floors in it, and glass balls,
and an integer k with the following property.
If one drops a glass ball from the floor number k or higher,
the ball will break. If one drops it from the floor number k-1
or lower, it will not break.
To determine this number k by experiemt, but you have
only two balls. Find an algorithm of doing this which will require
the minimal number of drops in the worst case for this algoruthm.