Go language Implementation Exercise--loops and Functions

This is a creation in Article, where the information may have evolved or changed.

To find the square root of a kind of called Newton algorithm of the text, first give a guess value, using the continuous approximation method to find the square root.

First we set the required number to a, its square root is x, and then we begin to make x=a, and then we enter a cycle, constantly making x= (x+a/x)/2, that is, X equals X and a/x mean, so that the iteration of about 7-10 times can get a square root x approximation.
Package Main


Import (
"FMT"
"Math"
)


Func Sqrt (x float64) float64 {
Z: = x
For I: = 0; I < 10; i++ {
z = (z + x/z)/2
}
Return Z
}


Func Main () {
Fmt. Println (SQRT (2))
Fmt. Println (Math. SQRT (2))
}