I used binary search in order to find closest square root of a given number. Binary search takes O(logn) time Space Complexity is O(1) since the program uses the same set o variables (square,mid,low,high)
I used binary search in order to find closest square root of a given number. Binary search takes O(logn) time Space Complexity is O(1) since the program uses the same set o variables (square,mid,low,high)