Gamified challenge · Binary search on an integer range
Given a whole number n ≥ 0 (up to 2³¹ − 1), write isqrt(n) that returns ⌊√n⌋: the largest whole r with r · r ≤ n. No sqrt, pow or ** 0.5: only whole-number arithmetic.
Example: isqrt(8) is 2 because 2² = 4 ≤ 8 < 9 = 3², and isqrt(16) is 4. Watch out in Java: mid * mid overflows an int once mid passes 46,340.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google