simple gcd algorithm added

software · software · commit 3a1a2cfc1990 · 2021-09-24T18:06:10.000+05:00
diff --git a/.gitignore b/.gitignore
@@ -0,0 +1 @@
+.DS_Store
diff --git a/Basic/gcd.py b/Basic/gcd.py
@@ -0,0 +1,16 @@
+# Find the greatest common denominator of two numbers
+# using Euclid's algorithm
+
+
+def gcd(a, b):
+    while (b != 0):
+        t = a       # set aside the value of a
+        a = b       # set a equal to b
+        b = t % b   # divide t (which is a) by b
+
+    return a
+
+
+# try out the function with a few examples
+print(gcd(60, 96))  # should be 12
+print(gcd(20, 8))   # should be 4
