Re: Fun with Unbounded Rational Numbers

[Paul Rubin <no.email@nospam.invalid>]

"Jeffrey R. Carter" <spam.jrcarter.not@spam.not.acm.org> writes:
> As I said in another post, the thing that was taking the time was
> subtracting R (2) in the calculation of Y.

I'm trying to understand why that caused a bottleneck in the Ada
implementation when it didn't with other implementations.

> I made some improvements to the addition algorithm 

Oh, ok, you mean the rational number functions were something you were
working on rather than a released library.  That makes more sense--there
was some kind of algorithmic bug in it that's taken care of now.

I'd be interested to know if you get reasonable answers after 10 or 15
iterations.  Fwiw, for depth 7, I get:

  4946041176255201878775086487573351061418968498177    /
  3497379255757941172020851852070562919437964212608         

Higher depths get bigger numbers very quickly but I can supply the
values if you want to check them against your own implementation.