Why does bisection search freeze forever on the square root of 0.25, and how does one change to the endpoints fix it?
Short drills on what this video just taught. Write the code, run the checks, and reveal the answer only if you are stuck.
A bisection search is about to begin over the interval [0, 60]. The next guess is always the midpoint of the current interval.
Compute that midpoint and assign it to first_guess.