Skip to content

Latest commit

 

History

History

euclids_gcd

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Haskell
Haskell
 
 
Nim
Nim
 
 
Rust
Rust
 
 
Swift
Swift
 
 
c#
c#
 
 
c++
c++
 
 
c
c
 
 
go
go
 
 
java
java
 
 
javascript
javascript
 
 
node.js
node.js
 
 
python
python
 
 
ruby
ruby
 
 
scala
scala
 
 
README.md
README.md
 
 

README.md

Euclidean GCD

Recall that the Greatest Common Divisor (GCD) of two integers A and B is the largest integer that divides both A and B. The Euclidean Algorithm is a technique for quickly finding the GCD of two integers.