Talk:Lehmer's GCD algorithm: Difference between revisions

Content deleted Content added
Jafet (talk | contribs)
Created page with '== Draft == Hope I've got the algorithm right. Maybe someone could write up a program to test it. We should also make note of the numerous variants on this algorith...'
 
Draft: Same number of digits? Argh!
Line 1:
== Draft ==
Hope I've got the algorithm right. Maybe someone could write up a program to test it. We should also make note of the numerous variants on this algorithm eg. Jebelean etc. sometime. [[User:Jafet.vixle|Jafet]] 17:02, 21 December 2006 (UTC)
 
:This looks like an algorithm well-suited for [[Matlab]] or some [[functional programming]] language, with multiple assignment and matrices. My question is, how on earth do you tell whether two numbers have the same number of digits in constant time, unless you're keeping track of the number of digits independently somehow (e.g., if this is part of a [[bignum]] library)? Without some kind of "<code>similar_size(a,b)</code>" primitive, we're not going to be able to write concise code for this algorithm, are we? --[[User:Quuxplusone|Quuxplusone]] 03:18, 23 December 2006 (UTC)