How do just low, high, and a midpoint guess collapse 23 million square-root guesses down to about 30?
Short drills on what this video just taught. Write the code, run the checks, and reveal the answer only if you are stuck.
Bisection search for the square root of 90 starts on the interval that runs from low = 0 to high = 90. Its first guess is the midpoint of that interval.
Compute that first guess and assign it to first_guess.