Revision as of 11:54, 31 March 2006 edit 134.102.210.237 (talk) unsigned integers ← Previous edit		Revision as of 22:31, 13 April 2006 edit undo Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits Implementations Next edit →
Line 90: :Sounds good to me. The point of this code sample is just to illustrate how efficient binary GCD is on a real machine. Feel free to plug in the most optimized version you can imagine. [[User:Deco\|Deco]] 19:50, 31 October 2005 (UTC) == Implementations == I've removed the ML implementation, because it teaches more about ML than about the algorithm. I have my doubts about the value of the assembly version, but I can't really assess it as I can't read it. IMHO, the C implementation ''is'' important because it exemplifies the use of bitwise operations for efficiency. [[User:Qwertyus\|Qwertyus]] 22:31, 13 April 2006 (UTC)

Talk:Binary GCD algorithm: Difference between revisions