How can a loop that just keeps squaring guesses decide whether a number is a perfect square — and know exactly when to give up?
Short drills on what this video just taught. Write the code, run the checks, and reveal the answer only if you are stuck.
You are checking whether x is a perfect square, and the search is currently sitting on guess. Compute the square of the current guess and assign that number to square.
Hint: ** raises a number to a power.