Jay-davisphem / Greatest-Common-Divisor Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

GCD/HCF in two Algorithms; (a) Trial and Error Algorithm (b) Euclid's Algorithm. Both written in C.

1 star 0 forks Branches Tags Activity

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
README.md		README.md
__finding_GCD.c		__finding_GCD.c

Repository files navigation

Greatest-Common-Divisor

GCD/HCF in two Algorithms; (a) Trial and Error Algorithm (b) Euclid's Algorithm. Both written in C.