- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Program to compute gcd of two numbers recursively in Python
Suppose we have two numbers a and b. We have to find the GCD of these two numbers in recursive way. To get the GCD we shall use the Euclidean algorithm.
So, if the input is like a = 25 b = 45, then the output will be 5
To solve this, we will follow these steps −
- Define a function gcd() . This will take a, b
- if a is same as b, then
- return a
- otherwise when a < b, then
- return gcd(b, a)
- otherwise,
- return gcd(b, a - b)
Example
Let us see the following implementation to get better understanding −
def gcd(a, b): if a == b: return a elif a < b: return gcd(b, a) else: return gcd(b, a - b) a = 25 b = 45 print(gcd(a, b))
Input
25, 45
Output
5
- Related Articles
- Swift Program to Find GCD of two Numbers
- Java Program to Find GCD of two Numbers
- Kotlin Program to Find GCD of two Numbers
- GCD of more than two (or array) numbers in Python Program
- Haskell program to find the gcd of two numbers
- Python Program for GCD of more than two (or array) numbers
- Program to find GCD or HCF of two numbers in C++
- Java program to find the GCD or HCF of two numbers
- Find GCD of two numbers
- C++ Program to Find GCD of Two Numbers Using Recursive Euclid Algorithm
- C++ Program for GCD of more than two (or array) numbers?
- Java Program for GCD of more than two (or array) numbers
- GCD and LCM of two numbers in Java
- Program to find GCD or HCF of two numbers using Middle School Procedure in C++
- C++ Program for GCD 0.of more than two (or array) numbers?

Advertisements