DEV Community

saurabh belote
saurabh belote

Posted on

3 2

find gcd with recursion

def gcd(a,b):
    assert int(a) == a and int(b) == b, 'the number must be integer only ! '
    if a < 0 :
        a = -1 * a
    if b < 0 :
        b = -1 * b
    if b == 0 :
        return a 
    else :
        return gcd(b, a%b)

print(gcd(48, 12))                   
Enter fullscreen mode Exit fullscreen mode

Top comments (0)

Billboard image

The Next Generation Developer Platform

Coherence is the first Platform-as-a-Service you can control. Unlike "black-box" platforms that are opinionated about the infra you can deploy, Coherence is powered by CNC, the open-source IaC framework, which offers limitless customization.

Learn more

👋 Kindness is contagious

Please leave a ❤️ or a friendly comment on this post if you found it helpful!

Okay