C Program to Find G.C.D Using Recursion

Example to find the GCD of two positive integers (entered by the user) using recursion in C programming.
To understand this example, you should have the knowledge of following C programming topics:
  • C Programming Functions
  • C Programming User-defined functions
  • C Programming Recursion
This program takes two positive integers as input from the user and calculates GCD using recursion. Read - Programming language
Visit this page to learn how you can calculate the GCD using loops.

Example: GCD of Two Numbers using Recursion

#include <stdio.h>
int hcf(int n1, int n2);
int main()
{
   int n1, n2;
   printf("Enter two positive integers: ");
   scanf("%d %d", &n1, &n2);

   printf("G.C.D of %d and %d is %d.", n1, n2, hcf(n1,n2));
   return 0;
}

int hcf(int n1, int n2)
{
    if (n2 != 0)
       return hcf(n2, n1%n2);
    else 
       return n1;
}
Output
Enter two positive integers: 366
60
G.C.D of 366 and 60 is 6.

Comments

Post a Comment

Popular posts from this blog

C Program to Find the Sum of Natural Numbers using Recursion

Example to find the sum of natural numbers by using a recursive function. To understand this example, you should have the knowledge of following C programming topics: C Programming User-defined functions C Programming Recursion The positive numbers 1, 2, 3... are known as natural numbers. The program below takes a positive integer from the user and calculates the sum up to the given number. You can find the sum of natural numbers using loop as well. However, you will learn to solve this problem using recursion here. Read -  Programming language Example: Sum of Natural Numbers Using Recursion #include <stdio.h> int addNumbers ( int n ); int main () { int num ; printf ( "Enter a positive integer: " ); scanf ( "%d" , & num ); printf ( "Sum = %d" , addNumbers ( num )); return 0 ; } int addNumbers ( int n ) { if ( n != 0 ) return n + addNumbers ( n - 1 ); el...
Read more

C Program to Check Whether a Number can be Expressed as Sum of Two Prime Numbers

Example to check if an integer (entered by the user) can be expressed as the sum of two prime numbers of all possible combinations with the use of functions.  Read -  Programming language To understand this example, you should have the knowledge of following C programming topics: C if, if...else and Nested if...else Statement C Programming for Loop C Programming Functions C Programming User-defined functions To accomplish this task,  checkPrime()  function is created. The  checkPrime()  returns 1 if the number passed to the function is a prime number.  Example: Integer as a Sum of Two Prime Numbers #include <stdio.h> int checkPrime ( int n ); int main () { int n , i , flag = 0 ; printf ( "Enter a positive integer: " ); scanf ( "%d" , & n ); for ( i = 2 ; i <= n / 2 ; ++ i ) { // condition for i to be a prime number if ( checkPrime ...
Read more

C Program to Check Prime or Armstrong Number Using User-defined Function

Example to check whether an integer is a prime number or an Armstrong or both by creating two separate functions. To understand this example, you should have the knowledge of following C programming topics: C Programming for Loop C Programming while and do...while Loop C Programming break and continue Statement C Programming Functions Types of User-defined Functions in C Programming In this program, two user-defined functions  checkPrimeNumber()  and  checkArmstrongNumber() are created. The  checkPrimeNumber()  returns 1 if the number entered by the user is a prime number. Similarly,  checkArmstrongNumber()  returns 1 if the number entered by the user is an Armstrong number. Read -  Programming language Visit these pages to learn to check whether a number is a prime number or not an Armstrong number or not Example: Check Prime and Armstrong Number #include <stdio.h> #include <math.h>...
Read more