Revision as of 17:09, 31 October 2005 edit 80.175.250.218 (talk) No edit summary		Revision as of 19:50, 31 October 2005 edit undo Dcoetzee (talk \| contribs) 37,529 edits Sounds good Next edit →
Line 84: mov r0, r1, asl r3 @ Put r1 << r3 in the result register bx lr @ Return to caller :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)

Talk:Binary GCD algorithm: Difference between revisions