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.
-
Notifications
You must be signed in to change notification settings - Fork 0
GhanimAlmansouri/Euclidean-Algorithm
About
A simple program that calculates the Greatest Common Divisor through a user input
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published