greatest common divisor

Author: georgecatalin

Learn_CPP_Programming_Deep_Dive/Section 7 Loops/Program_for_finding_greatest_common_divisor/main.cpp

@@ -0,0 +1,30 @@
+#include <iostream>
+
+using namespace std;
+
+int main()
+{
+    cout<<"Enter the numbers to check for the greatest common divisor"<<endl;
+
+    int initial_m, initial_n;
+    cin>>initial_m>>initial_n;
+
+    int n, m;
+    m = initial_m;
+    n = initial_n;
+
+    while(m!=n)
+    {
+        if(m>n)
+        {
+            m = m-n;
+        }
+        else if(n>m)
+        {
+            n = n-m;
+        }
+    }
+    cout<<"The greatest common divisor of the numbers "<<initial_m<<" and "<<initial_n<<" is "<<n<<endl;
+
+    return 0;
+}

README.md

@@ -8,6 +8,7 @@ The content within this repository is my own work produced as a result of comple
 ![Course Info](2023-10-19_17-30-00.png)
 
 ## IDE used
+Visual Studio Code
 
 ### About me
 * George Calin