Editing Binary GCD algorithm (section)

==References==
<references>
<ref name="Stein">{{Citation |first=J. |last=Stein |title=Computational problems associated with Racah algebra |journal=Journal of Computational Physics |volume= 1 |issue=3 |pages=397–405 |date=February 1967 |issn=0021-9991 |doi=10.1016/0021-9991(67)90047-2|bibcode=1967JCoPh...1..397S }}</ref>

<ref name="Knuth98">{{Citation |first=Donald |last=Knuth |author-link=Donald Knuth |series=[[The Art of Computer Programming]] |volume=2 |title=Seminumerical Algorithms |edition=3rd |publisher=Addison-Wesley |isbn=978-0-201-89684-8 |year=1998 }}</ref>

<ref name="intel">{{Cite web | title=Avoiding the Cost of Branch Misprediction | first=Rajiv | last=Kapoor | date=21 February 2009 | website=Intel Developer Zone | url=https://software.intel.com/content/www/us/en/develop/articles/avoiding-the-cost-of-branch-misprediction.html }}</ref>

<ref name="lemire">{{Cite web | title=Mispredicted branches can multiply your running times | first=Daniel | last=Lemire | date=15 October 2019 | url=https://lemire.me/blog/2019/10/15/mispredicted-branches-can-multiply-your-running-times/ }}</ref>

<ref name="rust disassembly">{{Cite web | title=Compiler Explorer | first=Matt | last=Godbolt | access-date=4 February 2024 | url=https://rust.godbolt.org/z/56jva3KPn }}</ref>

<ref name="egcd-knuth">{{Harvnb|Knuth|1998|p=646}}, answer to exercise 39 of section 4.5.2</ref>

<ref name="egcd-applied-crypto">{{Cite book |chapter=§14.4 Greatest Common Divisor Algorithms |chapter-url=http://cacr.uwaterloo.ca/hac/about/chap14.pdf#page=17 |title=Handbook of Applied Cryptography |url=http://cacr.uwaterloo.ca/hac/ |pages=606–610 |date=October 1996 |publisher=CRC Press |first1=Alfred J. |last1=Menezes |first2=Paul C. |last2=van Oorschot |first3=Scott A. |last3=Vanstone |isbn=0-8493-8523-7 |access-date=9 September 2017}}</ref>

<ref name="egcd-cohen">{{cite book |last=Cohen |first=Henri |author-link= Henri Cohen (number theorist) |year=1993 |title=A Course In Computational Algebraic Number Theory
|pages=17–18 |chapter=Chapter 1 : Fundamental Number-Theoretic Algorithms <!-- TODO: Section 3: Euclid's algorithms -->
|isbn= 0-387-55640-0|publisher=[[Springer-Verlag]]|series=[[Graduate Texts in Mathematics]]|volume=138
|url= https://books.google.com/books?id=hXGr-9l1DXcC}}</ref>

<ref name="gmplib">{{Cite web | url=http://gmplib.org/manual/Binary-GCD.html | title=GNU MP 6.1.2: Binary GCD}}</ref>
<ref name="stehlé-zimmermann">{{citation
 | last1 = Stehlé | first1 = Damien
 | last2 = Zimmermann | first2 = Paul | author-link2 = Paul Zimmermann (mathematician)
 | contribution = A binary recursive gcd algorithm
 | doi = 10.1007/978-3-540-24847-7_31
 | mr = 2138011
 | pages = 411–425
 | publisher = Springer, Berlin
 | series = Lecture Notes in Comput. Sci.
 | title = Algorithmic number theory
 | contribution-url = http://hal.archives-ouvertes.fr/docs/00/07/15/33/PDF/RR-5050.pdf
 | volume = 3076
 | year = 2004 | isbn = 978-3-540-22156-2
 | citeseerx = 10.1.1.107.8612
 | s2cid = 3119374
 | id = INRIA Research Report RR-5050
 }}.</ref>
<ref name="bit-complexity">{{Citation | first1 = Ali | last1 = Akhavi | first2 = Brigitte | last2 = Vallée | title = Average Bit-Complexity of Euclidean Algorithms | year = 2000 | journal = Proceedings ICALP'00, Lecture Notes Computer Science 1853 | pages = 373–387 | url = https://vallee.users.greyc.fr/Publications/icalp8-2000.ps | citeseerx = 10.1.1.42.7616}}</ref>
<ref name=brenta>{{cite conference |first=Richard P. |last=Brent |author-link=Richard P. Brent |url=http://wwwmaths.anu.edu.au/~brent/pub/pub183.html |title=Twenty years' analysis of the Binary Euclidean Algorithm |conference=1999 Oxford-Microsoft Symposium in honour of Professor Sir Antony Hoare |date=13–15 September 1999 |location=Oxford}}</ref>
<ref name=brentb>{{cite tech report |first=Richard P. |last=Brent |author-link=Richard P. Brent |title=Further analysis of the Binary Euclidean algorithm |publisher=Oxford University Computing Laboratory |id=PRG TR-7-99 |date=November 1999 |arxiv=1303.2772 |url=https://www.cs.ox.ac.uk/techreports/oucl/tr-7-99.html}}</ref>
<ref name="weilert">{{cite journal |first=André |last=Weilert |title=(1+i)-ary GCD Computation in Z[i] as an Analogue to the Binary GCD Algorithm
|date=July 2000 |journal=Journal of Symbolic Computation |volume=30 |issue=5 |pages=605–617 |doi=10.1006/jsco.2000.0422|doi-access=free }}</ref>
<ref name="eisenstein">{{cite conference |last1=Damgård |first1=Ivan Bjerre |last2=Frandsen |first2=Gudmund Skovbjerg
|title=Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers |doi=10.1007/978-3-540-45077-1_11
|doi-access= |pages=109–117 |conference=14th International Symposium on the Fundamentals of Computation Theory |location=[[Malmö]], Sweden |date= 12–15 August 2003}}</ref>
<ref name="some-quadratic-rings">{{cite conference |last1=Agarwal |first1=Saurabh |last2=Frandsen |first2=Gudmund Skovbjerg
|title=Binary GCD Like Algorithms for Some Complex Quadratic Rings |doi=10.1007/978-3-540-24847-7_4 |pages=57–71
|conference=Algorithmic Number Theory Symposium |date= 13–18 June 2004 |location=[[Burlington, VT]], USA}}</ref>
<ref name="UFD-quadratic-rings">{{cite conference |last1=Agarwal |first1=Saurabh |last2=Frandsen |first2=Gudmund Skovbjerg
|title=A New GCD Algorithm for Quadratic Number Rings with Unique Factorization |doi=10.1007/11682462_8 |pages=30–42
|conference=7th Latin American Symposium on Theoretical Informatics |date= 20–24 March 2006 |location=Valdivia, Chile}}</ref>
<ref name="integer-rings">{{cite conference |last=Wikström |first=Douglas
|title=On the l-Ary GCD-Algorithm in Rings of Integers |doi=10.1007/11523468_96 |pages=1189–1201 |date= 11–15 July 2005
|conference=Automata, Languages and Programming, 32nd International Colloquium |location=Lisbon, Portugal}}</ref>
</references>