The comment "Just compute base^k until base^k >= m." also does not reflect
what the code is actually doing. What it is actually doing is dividing m
by base until the remainder is non-zero.
-s
On Fri, Dec 23, 2011 at 15:04, Barton Willis <willisb at unk.edu> wrote:
> Dieter Kaiser <kaiser at st-joseph-berlin.de> wrote on 12/23/2011 12:15:42
> PM:
>
> >
>
> > I have found no problems with the implementation, but I will look again
> > into the algorithmus. Perhaps the documentation should be improved.
>
> I see nothing wrong or slow about the algorithm--only the source code
> documentation is wrong. I only
> noticed this because the source code documentation incorrectly states that
> exponent-of uses (what I would
> think) is a slow method.
>
> --bw
>