The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we help you to solve your academic and programming questions fast.
Watch related videos of your favorite subject.
Connect with students from different parts of the world.
See Our team
Wondering how we keep quality?
Got unsolved questions?

PROGRAMMINGMACHINE-LEARNING-->View question

## Write a Program to find GCD of two numbers using Euclid's Algorithm?

its about Write a Program to find GCD of two numbers using Euclid's Algorithm

Taged users:

Likes:
Be first to like this question

Dislikes:
Be first to dislike this question
#include <stdio.h>

// Iterative function to calculate gcd of two numbers
// using Euclid’s Algorithm (basic version)
int euclid(int a, int b)
{
// do until the two numbers become equal
while (a != b)
{
// replace larger number by its difference with the smaller number
if (a > b)
a = a - b;
else
b = b - a;
}

return a; // or b (since both are equal)
}

// main function
int main()
{
int a = 30;
int b = 50;

printf("euclid(%d, %d) = %d", a, b, euclid(a, b));

return 0;
}

Likes:
|Ananth

Dislikes:
Be first to dislike this answer

### Watch more videos from this user Here

Learn how to upload a video and start earning here

Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.