Content deleted Content added
revert last 2; unintelligible |
→Assembly code: new section |
||
Line 300:
: [[Binary gcd]] is a redirect to [[Binary GCD algorithm]]. That link is intentional; anybody looking for the first is redirected to the article at the second. There is no need to edit [[Binary gcd]]. [[User:Glrx|Glrx]] ([[User talk:Glrx|talk]]) 18:58, 13 January 2012 (UTC)
== Assembly code ==
I have once again reverted the addition of assembly code to this article.[https://en.wikipedia.org/w/index.php?title=Binary_GCD_algorithm&diff=595047179&oldid=594838551] It is the duty of the person trying to insert material to garner consensus; see [[WP:BRD]].
The material is inappropriate for the article. It is irrelevant for order statistics because it deals with a fixed size number. GCD for 32-bit or 64-bit numbers is O(1). The issue for algorithms is behavior for very large numbers (e.g., [[arbitrary precision]]).
The assembly code is also too detailed for this article. Algorithms should be given in psuedo code. Higher level languages can also be used. ARM assembly is just too distant.
The code wants to be kept because the [[branch predication]] article referred to it; branch prediction is an irrelevant technique when subtracting 1000 digit numbers. The branch predication article should contain its own examples.
[[User:Glrx|Glrx]] ([[User talk:Glrx|talk]]) 22:43, 11 February 2014 (UTC)
| |||