GCD/HCF in two Algorithms; (a) Trial and Error Algorithm (b) Euclid's Algorithm. Both written in C.
-
Notifications
You must be signed in to change notification settings - Fork 0
Jay-davisphem/Greatest-Common-Divisor
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
GCD/HCF in two Algorithms; (a) Trial and Error Algorithm (b) Euclid's Algorithm. Both written in C.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published