##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Finding the root
You can use binary search to find the square root. Search for an integer in the range such that .
For each midpoint , compute . If it equals , you found it. If it's less, search the right half. If it's more, search the left half.
This runs in time because you halve the search space at each step. No square root function needed.
