Merge pull request #32 from ashu01/master

LCM using gcd

Author: OmkarPathak

pygorithm/math/lcm_using_gcd.py

@@ -0,0 +1,32 @@
+# Author: Ashutosh Gupta
+# Created On: 8/17/2017
+# Time: 10:03 PM
+
+
+def gcd(x, y):
+    """
+    Function to find gcm (greatest common divisor) of two numbers
+    :param x: first number
+    :param y: second number
+    :return: gcd of x and y
+    """
+    while y != 0:
+        (x, y) = (y, x % y)
+    return x
+
+
+def lcm_using_gcd(List):
+    """ function to find LCM for given list of elements
+
+        :param List: List of which LCM is to be found out
+    """
+    lcm = List[0]
+    for element in List:
+        lcm = lcm * element / gcd(lcm, element)
+
+    return lcm
+
+def get_code():
+    """ returns the code for the current class """
+    import inspect
+    return inspect.getsource(lcm_using_gcd)

tests/test_math.py

@@ -2,12 +2,16 @@
 
 from pygorithm.math import (
     lcm,
+    lcm_using_gcd,
     sieve_of_eratosthenes)
 
 class TestLCM(unittest.TestCase):
     def test_lcm(self):
         self.assertEqual(lcm.lcm([3, 12, 16]), 48)
 
+    def test_lcm_using_gcd(self):
+        self.assertEqual(lcm_using_gcd.lcm_using_gcd([3, 12, 16]), 48)
+
 class TestSieveOfEratosthenes(unittest.TestCase):
     def test_sieve_of_eratosthenes(self):
         self.assertEqual(sieve_of_eratosthenes.sieve_of_eratosthenes(10), [2, 3, 5, 7])