Editing Binary GCD algorithm (section)

==Further reading==
* {{cite book |first=Donald |last=Knuth |author-link=Donald Knuth |series=[[The Art of Computer Programming]] |volume=2
|title=Seminumerical Algorithms |chapter=§4.5 Rational arithmetic |pages=330–417
|edition=3rd |publisher=Addison-Wesley |isbn=978-0-201-89684-8 |year=1998 |ref=none}}
Covers the extended binary GCD, and a probabilistic analysis of the algorithm.

* {{cite book |last=Cohen |first=Henri |author-link= Henri Cohen (number theorist) |year=1993 |title=A Course In Computational Algebraic Number Theory
|pages=12–24 |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}}
Covers a variety of topics, including the extended binary GCD algorithm which outputs [[Bézout coefficients]], efficient handling of multi-precision integers using a variant of [[Lehmer's GCD algorithm]], and the relationship between GCD and [[simple continued fraction|continued fraction expansion]]s of real numbers.

* {{cite journal|last=Vallée |first=Brigitte | author-link=Brigitte Vallée
| title=Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators |pages=660–685
| date=September–October 1998 |journal=Algorithmica |volume=22 |issue=4 |doi=10.1007/PL00009246
|s2cid=27441335 | archive-url=https://web.archive.org/web/20110513012901/http://users.info.unicaen.fr/~brigitte/Publications/bin-gcd.ps
| url=https://users.info.unicaen.fr/~brigitte/Publications/bin-gcd.ps |archive-date=13 May 2011 |format=PS
}}
An analysis of the algorithm in the average case, through the lens of [[functional analysis]]: the algorithms' main parameters are cast as a [[dynamical system]], and their average value is related to the [[invariant measure]] of the system's [[transfer operator]].