Given a non-negative integer x, return the floor of its square root — the largest integer whose square doesn't exceed x — without using any built-in power or square-root function. The candidate answers 0 through x split cleanly into "square ≤ x" and "square > x", in that order, which makes this a binary search over the answer itself rather than over an array.