Apparently this algorithm is well known.The algorithm will build the square root answer bit by bit starting from the left-most bit to the last.Let's say we will support squaring up to a 8 bit unsigned integer for simplicity.let res be resultlet x be 8 bit unsigned integerlet n be the nth bit in the result where the 0th bit is the last bit.set res to 0for nth bit from 3 down to 0    change the nth bit of the res to 1    if res * res > x then: <- The Comparison         restore the nth bit back to 0return resThe return result will be a 4 bit unsigned integerFor Example: Finding the square root of 4(see image)Is this perhaps the Digit by Digit Calculation: Binary Numeral System (base 2)? Wiki Link hereThank you for your time!
Can you name this square root algorithm on an unsigned integer through the manipulation of the binary number?
algorithms;binary