Finished plagarism detector, added docs

1 files changed, 22 insertions, 0 deletions

diff --git a/docs/source/_static/QuickStart/simple_submission_1/euclid.py b/docs/source/_static/QuickStart/simple_submission_1/euclid.py
new file mode 100644
index 0000000..f72707a
--- /dev/null
+++ b/docs/source/_static/QuickStart/simple_submission_1/euclid.py
@@ -0,0 +1,22 @@
+# the newest!
+# assessment 1
+
+def gcd(m,n) -> int:
+    """Calculates the greatest common denominator between two numbers.
+
+    Args:
+        x (int): Number One
+        y (int): Number Two
+
+    Returns:
+        int: The GCD of the two numbers
+    """
+    if m< n:
+        (m,n) = (n,m)
+    if(m%n) == 0:
+        return n
+    else:
+        return (gcd(n, m % n)) # recursion taking place
+
+# gcd
+print(gcd(8,12))