[Haskell-cafe] Debugging Newton's method for square roots
ketil+haskell at ii.uib.no
Mon Oct 16 04:20:05 EDT 2006
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?
If I haven't seen further, it is by standing in the footprints of giants
More information about the Haskell-Cafe