[Merged] find gcd of 2 numbers

[soosoo]

can anyone give me a code to this programm pllllz i need it.

Write a program that computes the Greatest Common Divisor (GCD) of two positive integers m and n entered by the user (assume that m >= n).

GCD: is the largest positive number that exactly divides both m and n.

[Savage]

We are not allowed to give you a code,but we can help you write it and to give you some hints.

So to find a GCD you need two variables.One will take a value of larger and secound of smaller number.

Than you need a while loop that will only execute if smaller number is non-zero
number.

For example:

j-smaller number

i-larger number

k-this will represent modulo

while(j!=0)
{
              k=i%j;
              i=j;
              j=k;
}
GCD=i;

Savage

[soosoo]

thx for ur help

[soosoo]

hello can i know what is worong with my code

**code snipped**

[RedSon]

The experts on this site are more than happy to help you with your problems but they cannot do your assignment/program for you. Attempt the assignment/program yourself first and post questions regarding any difficulties you have or about a particular function of the code that you don't know how to achieve.

Please read the Posting Guidelines and particularly the Coursework Posting Guidlines.

Then when you are ready post a new question in this thread.

MODERATOR

[RedSon]

You must have a pointed question. You cannot just paste all of your code and say "someone tell me what is wrong".

[Savage]

Hi,

soosoo.

Is the explanation and example which I gave to you

here was

helpfull?.


Savage.

[RedSon]

Double posting is also an infringement upon the guidelines in the FAQ. Please read the entire FAQ before posting again. Threads have been merged.

[RedSon]

If you want to calculate the GCD of two numbers you need to break down your problem into the steps necessary. When you calculate a GCD on paper how do you do it? What are the steps involved?