Shifting nth root algorithm not useful for computing roots with a computer, as it is always outperformed by much simpler binary search, and has the same memory complexity. 1. 0 1 1 0 1 1. 7 3 2 0 5 1. 7 0 9 9 7 1. 6 2 6 5 7 Shifting nth root algorithm The shifting "n"th root algorithm is an algorithm for extracting the "n"th root of a positive real number which proceeds iteratively by shifting in "n" digits of the radicand, starting with the most significant, and produces one digit of the root on each iteration, in a manner similar
Square root Square root In mathematics, a square root of a number "a" is a number "y" such that ; in other words, a number "y" whose "square" (the result of multiplying the number by itself, or ) is "a". For example, 4 and −4 are square roots of 16 because . Every nonnegative real number "a" has a unique nonnegative square root, called the "principal square root", which is denoted by , where √ is called the "radical sign" or "radix". For example, the principal square root of 9 is 3, which is denoted by = 3, because and 3 is