Two Eggs, One Hundred Floors

There is a 100-floor building and two identical eggs. An egg breaks if dropped from floor $h$ or above for some unknown threshold $h$ (and survives any drop below $h$); a survived egg can be reused, a broken one cannot. You want to determine $h$ with certainty. Drops are made one at a time and you choose each next floor adaptively. What is the minimum number of drops that guarantees you can identify $h$ in the worst case?