Find Integer Square Root Using Binary Search
Problem: Find the largest integer x such that x² ≤ N
Logic:
• If mid² ≤ N: mid could be answer, save it and search
RIGHT for larger
• If mid² > N: Overshoot! Search LEFT for smaller
Time: O(log N)