Add files via upload

Euclid's Algorithm is helpful when there is need to get the hcf that is greatest common divisor or highest common factor so in that case we use the algorithm.....

Author: DeependraParmar

19_euclidsalgorithm.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+using namespace std;
+int greatestCommonDivisor(int a,int b){
+    if(a==0){
+        return a;
+    }
+    else if(b==0){
+        return b;
+    }
+    else{
+        while(a!=b){
+            if(a>b){
+                a = a-b;
+            }
+            else{
+                b=b-a;
+            }
+        }
+    }
+    return a;
+}
+int LCM(int a,int b){
+    return (a*b)/greatestCommonDivisor(a,b);
+}
+int main(){
+    // Euclid's algorithm is basically derived to find the gcd of two numbers that is highest common factor or greatest common divisor..... 
+    int a,b;
+    cout<<"Enter the first number: ";
+    cin>>a;
+    cout<<"Enter the second number: ";
+    cin>>b;
+
+    int gcd = greatestCommonDivisor(a,b);
+    cout<<endl<<"GCD is: "<<gcd<<endl;
+    cout<<"LCM is: "<<LCM(a,b)<<endl;
+
+
+    return 0;
+}