Find G.C.D.(Greatest Common Divisor) of two numbers.

PROCEDURE:-

      1.input two interger values a and b
      2.if a is greater than b
      3.set n=b
      4.else set n=a
      5.repeat steps  6 and 9 until n is greater than 0
      6 find a modulo n and b modulo n, if modulo value is 0
      7. print gcd value as n
      8.stop
      9else decrement n by 1
CODE:-

#include<stdio.h>
void main()
{
int a,b,n;
printf(“enter two numbers for a,b to find GCD”);
scanf(“%d %d “,&a,&b);
if(a>b)
      n=b;
else
      n=a;
do
{
      if(a%n = = 0 && b%n = = 0)

      {

   printf(“ GCD for %d and %d is  %d”,a,b,n);
   break;

      }

      else

      n=n-1;

  }while(n>0);
}


Input:- enter two numbers for  a ,b to find GCD  16 24
Output:- GCD for 16 and 24 is  8