square root algorithm

[Paul Zimmermann]

> Date: Wed, 16 Jun 2010 11:29:11 +0100
> From: David Buezas <david.buezas at gmail.com>
> 
> Hello, I developed a different square root algorithm in O(n^2) (n being the
> number of digits) and I don't know if it might be useful. I know that there
> exist better algorithms to do that but I don't know the hidden constants
> involved. It might be that my algorithm is better in some range.
> 
> Can I send you the algorithm?
> Thanks
> David Buezas

of course. But better, you can implement it in GMP, and compare it with the
existing code.

Paul Zimmermann