[Haskell-cafe] Debugging Newton's method for square roots

[Ketil Malde]

Clifford Beshers <clifford.beshers at linspire.com> writes:

> There was some excellent advice in the other responses, but I thought
> it worth mentioning that your Haskell code converges if you step up
> from Float -> Float to Double -> Double.

Used to be faster, too, IIRC.  Is that still the case?

-k
-- 
If I haven't seen further, it is by standing in the footprints of giants