Note that the binary number system has only two digits (also known as bits) - 0 and 1. That is, we go about finding the square root digit-by-digit, building upon the value obtained thus far.
![calctape square root calctape square root](https://i.ytimg.com/vi/t9Os6gVoxVE/hqdefault.jpg)
The crux of the algorithm remains the same. Now, let’s test our understanding of the algorithm by trying it out in binary base! The Algorithm in Binary Base
![calctape square root calctape square root](https://i.ytimg.com/vi/RGCW90Lv9f4/maxresdefault.jpg)
So, the maximum digit whose square ≤ 50 is 7. In our example, the number represented by the group = 50. Find the maximum digit whose square is less than or equal to the leftmost group.
![calctape square root calctape square root](http://1.bp.blogspot.com/-nbZhtza0EyU/T18T1jMYg6I/AAAAAAAAAfg/IpSA9A7MJmo/s1600/2012.03.13+-+LessonsInCoding+-+The+sqrt+Function+in+C+%2526+C%252B%252B.jpg)
Also, in cases where the smallest prime factor of the given number is quite large, we may not even be able to start with the procedure (e.g., 12643277 = 3089 * 4093). Digit-by-digit calculation: Notice that the above method turns out to be extremely tedious when dealing with large numbers.Calculating the square root of 900 using prime factorisation.