🏣 Clean up for arxiv

book/ebook_src/builtin_structures/find_gcd.py

@@ -0,0 +1,29 @@
+#!/usr/bin/env python
+
+__author__ = "bt3"
+
+
+
+def finding_gcd(a, b):
+    ''' implements the greatest common divider algorithm '''
+    while(b != 0):
+        result = b
+        a, b = b, a % b
+    return result
+
+
+def test_finding_gcd():
+    number1 = 21
+    number2 = 12
+    assert(finding_gcd(number1, number2) == 3)
+    print('Tests passed!')
+
+if __name__ == '__main__':
+    test_finding_gcd()
+
+
+
+
+
+
+