Skip to content

Latest commit

 

History

History
2 lines (2 loc) · 289 Bytes

README.md

File metadata and controls

2 lines (2 loc) · 289 Bytes

Euclidean-Algorithm

Also referred to as Euclid's Algorithm, is a method of computing the greatest common divisor(GCD) of two positive integers. This Simple programs takes in two integral user inputs and outputs the GCD, calculation has been achieved using div from the standard library.