How can a square-root search creep upward until it's 'close enough' — yet loop forever on 54321 until one extra stop condition saves it?
Short drills on what this video just taught. Write the code, run the checks, and reveal the answer only if you are stuck.
The "good enough" test measures how far the square of guess lands from x. For the
values below — x = 36 and a guess of 5.5 — compute that distance and assign it to
distance. A distance is never negative.
(Hint: **2 squares a number and abs() gives the absolute value.)