Python - Greatest Common Divisor W/ Recursion

With the help of Euclid's algorithm, we create a GCD function recursively. GCD of 2 integers

[@abdallahsiyabi4784]

Thumbs up for a great explanation of call stacks. I used to think recursion updated first func call, like this function would terminate because b == 0 as a result of recursion. Thanks man.

[@wrttech422]

Glad it was helpful!

[@kacpermokrzycki2144]

as a curiosity you can also write def GCD(a,b): return a if b==0 else GCD(b,a%b) if anyone is obsessed with shortcode :))

[@th3crypt]

Such Talent, dope g

[@donpilarsuarezgudino5160]

Fantastic!! Of course I`ve learned something. What a lecture, man. Thanks a lot.

[@wrttech422]

Glad it was helpful!

[@dillic8656]

Thank you so much for explaining, this video helped me out alot.

[@BrainyiFY_o0]

Best video love it ❤❤❤

[@RahulSharma-oc2qd]

superb explanation...

[@Silent_poet]

Why the viewcount is so low