C++ program to find HCF of 2 integers using Euclid's division lemma (recursive)
it is an algorithm to find hcf of 2 numbers and using hcf to fnd lcm hcflcm = n1n2
.
-
Notifications
You must be signed in to change notification settings - Fork 4
PallavRastogi/HCF-Euclid-Division-Lemma
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
C++ program to find HCF of 2 integers using Euclid's division lemma (recursive)
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published