[OT] GCD Algorithm
Hernan Wilkinson
hernan.wilkinson at gmail.com
Fri Apr 20 18:53:14 UTC 2007
Sorry... I pressed the wrong button...
I wanted to ask for faster implementations of the GCD algorithm than the
Euclid's one.
We found on the web that the Lehmer's and the Binary GCD are faster... has
anyone experience on that? are they really faster? has anyone have a
implementation in Smalltalk? (or similar language like C++ :-) )
Thanks is advance and sorry to bother you people with this.
Hernan.
On 4/20/07, Hernan Wilkinson <hernan.wilkinson at gmail.com> wrote:
>
> Hi,
> th
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.squeakfoundation.org/pipermail/squeak-dev/attachments/20070420/9ac58f6a/attachment.htm
More information about the Squeak-dev
mailing list
|