Skip to content
/ Euclidean-Algorithm Public

A simple program that calculates the Greatest Common Divisor through a user input

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

GhanimAlmansouri/Euclidean-Algorithm

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits

Main.cpp

Main.cpp

 
 

README.md

README.md

 
 

Repository files navigation

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.

About

A simple program that calculates the Greatest Common Divisor through a user input

Topics

c-plus-plus algorithms cpp euclid euclidean greatest-common-divisor euclidean-algorithm

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages