Find GCD of Two Numbers Using Recursion

❮ Previous Next ❯

A Python program to compute the Greatest Common Divisor (GCD) of two numbers using recursion and the Euclidean algorithm.

Code Explanation in Short Points

Function Definition (gcd(a, b))
- A recursive function to calculate the Greatest Common Divisor (GCD).
Base Case (if b == 0)
- If b == 0, return a as the GCD.
Recursive Case (gcd(b, a % b))
- Call the function again with gcd(b, a % b).
- This process continues until b becomes 0.
User Input (num1 and num2)
- Takes two numbers from the user using input().
Function Call (gcd(num1, num2))
- Calls the function and prints the result.

Program:

def gcd(a, b):

    if b == 0:

        return a

    else:

        return gcd(b, a % b)

num1 = int(input("Enter first number: "))

num2 = int(input("Enter second number: "))

print(f"GCD of {num1} and {num2} is {gcd(num1, num2)}")

❮ Previous Next ❯

Python Practice Questions Tutorial

Python Practice Questions Tutorial

Find GCD of Two Numbers Using Recursion

Code Explanation in Short Points

Important Links

Python Practice Questions Tutorial

Python Practice Questions Tutorial

Python Coding Questions on Numbers

Python Coding Questions on String

Python Coding Questions On List

Python Coding Questions On Dictionary

Python Coding Questions On Star Pattern

Find GCD of Two Numbers Using Recursion

Code Explanation in Short Points

Important Links