Skip to content

Instantly share code, notes, and snippets.

@waddles
Last active August 29, 2015 14:15
Show Gist options
  • Save waddles/b52d51f4d49234badd11 to your computer and use it in GitHub Desktop.
Save waddles/b52d51f4d49234badd11 to your computer and use it in GitHub Desktop.
An implementation of Newton's method of approximating a square root, written in Go
/*
http://tour.golang.org/flowcontrol/8
Exercise: Loops and Functions
As a simple way to play with functions and loops, implement the square root function using Newton's method.
In this case, Newton's method is to approximate Sqrt(x) by picking a starting point z and then repeating:
z^2 - x
z = z - -------
2z
To begin with, just repeat that calculation 10 times and see how close you get to the answer for various values (1, 2, 3, ...).
Next, change the loop condition to stop once the value has stopped changing (or only changes by a very small delta). See if that's more or fewer iterations. How close are you to the math.Sqrt?
Hint: to declare and initialize a floating point value, give it floating point syntax or use a conversion:
z := float64(1)
z := 1.0
*/
package main
import (
"fmt"
"math"
)
const delta = 0.00000000001
func Sqrt(x float64) float64 {
z := 1.0
diff := delta + 1
for p := 1.0; diff > delta; p = z {
z -= (z * z - x) / (2 * z)
diff = math.Abs(p - z)
}
return z
}
func main() {
n := 3
fmt.Println(Sqrt(float64(n)))
fmt.Println(math.Sqrt(float64(n)))
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment