~~NOTOC~~
|<100% 25% - >|
^  \\ DATA ANALYTICS REFERENCE DOCUMENT\\ \\   ^^
^  Document Title:|Euclidean Algorithm|
^  Document No.:|1548421667|
^  Author(s):|Gerhard van der Linde|
^  Contributor(s):|  |



**REVISION HISTORY**
|< 100% 10% - - 10% 17% 10% >|
^  \\  Revision\\  \\  ^\\ Details of Modification(s)^\\ Reason for modification^  \\ Date  ^  \\ By  ^
|  [[:doku.php?id=algorithms:euclid&do=revisions|0]]  |Draft release|Euclidean Algorithm|  2019/01/25 13:07  |  Gerhard van der Linde  |


----

====== Euclidean Algorithm ======

The Euclidean Algorithm is a technique for quickly finding the GCD of two integers.

Greatest Common Divisor (GCD) of two integers A and B is the largest integer that divides both A and B.

{{help:algorithms:aa4da507-14c0-4741-8977-234ac58764e9.jpeg?nolink|}}