- Related Questions & Answers
- Average numbers in array in C Programming
- Add minimum number to an array so that the sum becomes even in C programming
- C Program for Tower of Hanoi
- C++ Program for Dijkstra’s shortest path algorithm?
- C/C++ Program for nth Catalan Number?
- C Program to Multiply two Floating Point Numbers?
- C program to find the length of a string?
- C Program to Check if all digits of a number divide it
- C Program to Check if a Given String is a Palindrome?
- Write a program to Delete a Tree in C programming
- Write a C program to print “ Tutorials Point ” without using a semicolon
- Sum triangle from an array in C programming
- Sum of the numbers up to N that are divisible by 2 or 5 in c programming
- Sum of the nodes of a Singly Linked List in C Program
- Sum of first n natural numbers in C Program

In this article, we will learn about the solution to the problem statement given below −

**Problem statement** − We will be given an array of number and we need to find the greatest common divisor.

If we need to find gcd of more than two numbers, gcd is equal to the product of the prime factors common to all the numbers provided as arguments. It can also be calculated by repeatedly taking the GCDs of pairs of numbers of arguments.

Here we will be implementing the latter approach

So now, let’s see the implementation

def findgcd(x, y): while(y): x, y = y, x % y return x l = [22, 44, 66, 88, 99] num1=l[0] num2=l[1] gcd=findgcd(num1,num2) for i in range(2,len(l)): gcd=findgcd(gcd,l[i]) print("gcd is: ",gcd)

Gcd is: 11

All the variables and functions are declared in global scope as shown in the image below −

In this article, we learned the approach to find the greatest common divisor of a given array of arguments.

Advertisements