News for hackers. Stuff that matters.
Re:What every computer programmer should know about floating... by jwmerrill on Tuesday September 16, 2014 @11:13AM (#8324882)
Just a heads up--the mediant algorithm can be O(d) in the size of the denominator for fractions that are close to 0 or close to 1 (it's possible for the denominator to increase by only 1 at each step).

The Aberth algorithm (I hadn't heard it called that; nice to know) is much more efficient--it converges quadratically.

There are no comments on this comment yet.