We use a for loop and start counting from 1 then we keep checking if both the numbers are divisible by a number and in this process we are also seeing to it that the number obtained is largest among all the divisors. Know more about ternary operator or conditional operator, watch a separate video tutorial: Ternary Operator / Conditional Operator In C.This C program is to find HCF/GCD of two numbers.HCF(Highest Common Factor)/GCD(Greatest Common Divisor) is the largest positive integer which divides each of the two numbers.For example gcd of 48 and 18 is 6 as divisors of 48 are 1,2,3,4,6,8,12,16,24,48 and divisors of 18 are 1,2,3,6,9,18, so the greatest common divisor is 6. Printf("GCD of %d and %d is %d.\n", num1, num2, gcd(num1, num2)) Source Code: C Program To Find GCD of Two Numbers using Recursion and Ternary or Conditional Operator: Euclid’s Algorithm #include
The HCF (Highest Common Factor or GCD (Greatest Common Divisor) of two integers is nothing but the largest integer that can exactly divide a given number without leaving a remainder. Euclidean algorithm to find GCD of two numbers states that GCD (a, b) GCD (b, b-a) GC D(a,b) GC D(b, b a). In above table gcd(33, 0) gets called, since n2 = 0, our program returns value of n1 as gcd, which is 33. Program to find the GCD of two numbers is discussed here. We can find the GCD of two numbers using the Prime Factorization method.
Lets assume that user has entered n1 = 1980 and n2 = 1617 n1 Printf("\nGCD of %d and %d is %d.\n", num1, num2, gcd(num1, num2)) Printf("Enter 2 positive integer numbers\n") Source Code: C Program To Find GCD of Two Numbers using Recursion: Euclid’s Algorithm #include Video Tutorial: C Program To Find GCD of Two Numbers using Recursion: Euclid’s Algorithm If n2 is 0, then value present in n1 is the gcd of (n1,n2). If n1 is 0, then value present in n2 is the gcd of (n1,n2). We need to recursively execute above 2 lines of logic until either n1 is 0 or until n2 is 0. If n2 > n1, we need to pass gcd(n1, n2%n1) If n1 > n2 we need to pass gcd(n1%n2, n2) Ex: gcd(n1, n2) Īccording to Euclid’s Algorithm, we’ll get the same gcd if we reduce the bigger number by modulo dividing it by smaller number. For example, if n1 is greater than n2, then reduce the value of n1 by replacing it with n1%n2.Īssume that we’ve a function gcd() which returns gcd of 2 numbers passed to it. If user inputs 2 numbers n1 and n2, reduce the bigger number by modulo dividing it by the smaller number. Source Code: C Program To Find GCD of Two Numbers using Recursion and Ternary or Conditional Operator: Euclid’s Algorithm.Source Code: C Program To Find GCD of Two Numbers using Recursion: Euclid’s Algorithm.Video Tutorial: C Program To Find GCD of Two Numbers using Recursion: Euclid’s Algorithm.
0 kommentar(er)
