How can u write program for finding gcd of two numbers?

Question

by using c language

Answer 1

#include<stdio.h>
int main()
{
int a,b,t;
printf("enterthevaluesa,b");
scanf("%d\n%d",&a,&b);
while(a<b)
{
t=a;
a=b;
b=t;
}
{while (!(b==0))
{
t=a;
a=b;
b=t%b;
}
}
{printf("gcdofa,b is %d",a)
}
return 0;
}

Answer 2

Use the Euclidean Algorithm: https://en.m.wikipedia.org/wiki/Euclidean_algorithm#Description

In the Implementation section, you'll find a pseudocode too!

Answer 3

It shouldn't be too hard to translate Wikipedia's pseudocode into C, which is

function gcd(a, b)
while b ≠ 0
t := b;
b := a mod b;
a := t;
return a;

If you show me your attempt, I'll be more than happy to guide you.

Answer 4

int a, b;
scanf("%d %d", &a, &b);
while(b^=a^=b^=a%=b);
printf("GCD is %d", a);

Answer 5

#include<stdio.h>
int main()
{
int a,b,t;
printf("enterthevaluesa,b");
scanf("%d\n%d",&a,&b);
while(a<b)
{
t=a;
a=b;
b=t;
}
{while (!(b==0))
{
t=a;
a=b;
b=t%b;
}
}
{printf("gcdofa,b is %d",a)
}
return 0;
}

Answer 6

Kirk Schafer made it a little shorter😆

Answer 7

Kishalaya Saha and now is the shortest i think i can do😆

Answer 8

there's probably a better way, but what came to mind for me was dividing each denominator by 2 until there is a list of prime numbers for each denominator. I would compare the lists. The sum of the compared results should equal the gcd. Best of luck to you.

Answer 9

Kishalaya Saha you're correct the mod operator takes care of this easily 😀

Answer 10

Steven M , it's actually a very clever algorithm, and is sometimes called the "(successive) division method". Many schools teach it too!

Answer 11

do it by using c language

Answer 12

no write program in c

Answer 13

Ah, Flandre Scarlet , I'd almost forgotten that cool XOR swap trick! Thanks! 😄