Another method added for GCD

maths/greatest_common_divisor.py

@@ -5,21 +5,40 @@
 """
 
 
+
+
 def gcd(a, b):
     """Calculate Greatest Common Divisor (GCD)."""
     return b if a == 0 else gcd(b % a, a)
 
 
+"""
+This method is more efficient.
+This method is not acquire more memory cause is no use of any stacks(chunk of a memory space).
+while above method is good one but acquire more memory for huge number because of more recursive call. 
+
+"""
+def gcd_by_iterative(x,y):
+    while y:
+        x,y=y,x%y
+    """Now return final answer that is GCD"""	
+    return x
+
+
 def main():
     """Call GCD Function."""
     try:
         nums = input("Enter two Integers separated by comma (,): ").split(",")
         num_1 = int(nums[0])
         num_2 = int(nums[1])
+
         print(f"gcd({num_1}, {num_2}) = {gcd(num_1, num_2)}")
+        print(f"By iterative gcd({num_1}, {num_2}) = {gcd_by_iterative(num_1, num_2)}")
+
     except (IndexError, UnboundLocalError, ValueError):
         print("Wrong Input")
 
-
+    
 if __name__ == "__main__":
     main()
+