Algorithm for computing square root of a perfect square integer?

exponentiation algebra-precalculus algorithms

My question is the following:

Is there a polytime non-numerical algorithm for computing square root of perfect square integers?

The more elementary the algorithm is, the better!

EDIT: This is probably the most silly question I ever asked (I hope!). As pointed out by picakhu, since the input integer $n$ is perfect square, we can simply do a binary search to find the number whose square equals to $n$.


The following should suffice, from Cohen: A course in computational algebraic number theory. enter image description hereenter image description here

Related

Every permutation is a product of two permutations of order 2
Does there exist a Banach space with no complemented closed subspaces?
Finding $\lim\limits_{x\to0}x^2\ln (x)$ without L'Hospital
Finding a Pythagorean triple $a^2 + b^2 = c^2$ with $a+b+c=40$
Distances between closed sets on metric spaces
Norm of adjoint operator in Hilbert space
How would I prove that this function is affine if $f(x+h)-f(x)=hf'(x)$?
Is $x^3-9$ irreducible over the integers mod 31?
Derive $\frac{d}{dx} \left[\sin^{-1} x\right] = \frac{1}{\sqrt{1-x^2}}$
Why is the math for negative exponents so?
The binomial formula and the value of $0^0$
Find the slope of a line given a point and an angle