algorithm for radicals?

May 3, 2011 at 2:53am
does anyone know of an effective way to compute square roots that wont just be brute forcing it by adding a puny decimal like .000000000001 and testing if when squared gives the right number? thank you :)
May 3, 2011 at 3:18am
like the sqrt function?
http://cplusplus.com/reference/clibrary/cmath/sqrt/

EDIT: And here are some faster implementations (that sacrifice some accuracy for more speed)
http://ilab.usc.edu/wiki/index.php/Fast_Square_Root
Last edited on May 3, 2011 at 3:20am
May 3, 2011 at 8:31pm
haha thank you :)
Topic archived. No new replies allowed.