Sorry... I pressed the wrong button...<br>I wanted to ask for faster implementations of the GCD algorithm than the Euclid's one.<br>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++ :-) )
<br><br>Thanks is advance and sorry to bother you people with this.<br>Hernan.<br><br><div><span class="gmail_quote">On 4/20/07, <b class="gmail_sendername">Hernan Wilkinson</b> <<a href="mailto:hernan.wilkinson@gmail.com">
hernan.wilkinson@gmail.com</a>> wrote:</span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">Hi,<br> th<br>
</blockquote></div><br>