Given a positive number n and precision p, find the square root of number upto p decimal places using binary search.
Note : Prerequisite : Binary search
Input : number = 50, precision = 3 Output : 7.071 Input : number = 10, precision = 4 Output : 3.1622
We have discussed how to compute integral value of square root in Square Root using Binary Search
1) As the square root of number lies in range 0 <= squareRoot <= number, therefore, initialize start and end as : start = 0, end = number.
2) Compare the square of mid integer with the given number. If it is equal to the number, then we found our integral part, else look for the same in left or right side depending upon the scenario.
3) Once we are done with finding the integral part, start computing the fractional part.
4) Initialize the increment variable by 0.1 and iteratively compute the fractional part upto p places. For each iteration, increment changes to 1/10th of it’s previous value.
5) Finally return the answer computed.
Below is the implementation of above approach :
Time Complexity : The time required to compute the integral part is O(log(number)) and constant i.e, = precision for computing the fractional part. Therefore, overall time complexity is O(log(number) + precision) which is approximately equal to O(log(number)).
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Digital Root (repeated digital sum) of square of an integer using Digital root of the given integer
- Check if a number is perfect square without finding square root
- Floor value Kth root of a number using Recursive Binary Search
- Check if a given number is a Perfect square using Binary Search
- C program to find square root of a given number
- Calculating n-th real root using binary search
- Meta Binary Search | One-Sided Binary Search
- Square root of a number using log
- Square root of a number without using sqrt() function
- Count numbers upto N which are both perfect square and perfect cube
- Find smallest perfect square number A such that N + A is also a perfect square number
- Smallest root of the equation x^2 + s(x)*x - n = 0, where s(x) is the sum of digits of root x.
- Find Square Root under Modulo p | Set 1 (When p is in form of 4*i + 3)
- Find Square Root under Modulo p | Set 2 (Shanks Tonelli algorithm)
- Long Division Method to find Square root with Examples
- Find Square Root under Modulo p | (When p is product of two primes in the form 4*i + 3)
- Floor square root without using sqrt() function : Recursive
- Fast method to calculate inverse square root of a floating point number in IEEE 754 format
- Square root of a number by Repeated Subtraction method
- Min operations to reduce N by multiplying by any number or taking square root
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.