Square Root

[bludstayne]

How can I implement a decently fast square root function? Is there any inline assembly I can use?

[Paul]

Do you need to take the sqr of the number every loop? If you don't then just find the sqr of the particular number and define it as a constant. If you still need a fast sqr function let me know. Private message me cause I normally forget where I've posted recently lol. :D

[Mike Bonham]

How can I implement a decently fast square root function? Is there any inline assembly I can use?


I'm not a programmer, and I'm not sure if this applies to your question or not, but check our Question of the Day ...

http://www.metalinmotion.com

If what you find there is of no help, I'll mention your post to our programming sub-team.

[Paul]

try this bit of code, it should give you a quick way to find square roots... but only for ints. It is accurate up to a certian point it should have enough accuracy for anything that needs to be done with our robots. If you need anything else let me know.

inline int sroot(int n)
{
int c = 0; int a = 1;
do {n -= a; a += 2; ++c;}
while (n > 0);
return c;
}