![]() |
| | #1 |
| Registered User Join Date: Oct 2009
Posts: 1
| The Euclidean algorithm i am a new member and i want some help in a pseudo-code i was asked to write a pseudo-code for the Euclidean algorithm this was the question " The euclidean algorithm determines the greatest common divisor (GCD) of two positive numbers by repatedly replacing the larger number with the result of subtracting the smaller one from it until the two numbers are equal" And this is my Answer Code: Get x,y //x,y any numbers
set gcd to 0 //gcd = Great Common divisor
if (x>0) and (y>0)
then if (x-y) > 0
then while (x>y)
{ set gcd to ( gcd + (x-y) )
set x to x-y
}
print " the GCD" + gcd
else if (y-x) > 0
then while (y>x)
{ set gcd to ( gcd + (y-x) )
set y to (y-x)
}
print "the GCD "+ gcd
else print " the numbers are equal"
end if
end if
else print " There is a negative number at least "
end if
and is it not could any one tell me why it is not correct and what is the correct code ?? i'm waiting guys |
| the_storm is offline | |
| | #2 |
| Rampaging 35 Stone Welsh Join Date: Apr 2007
Posts: 2,924
| Wrong forum, could someone move this? What you wrote isn't even C/C++, it looks like BASIC.
__________________ He is free, you say. Ah! That is his misfortune… These men… [have] the most terrible, the most imperious of masters, that is, need. … They must therefore find someone to hire them, or die of hunger. Is that to be free? - Simon Linguet |
| abachler is offline | |
![]() |
| Thread Tools | |
| Display Modes | |
|
Similar Threads | ||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Implement of a Fast Time Series Evaluation Algorithm | BiGreat | C Programming | 7 | 12-04-2007 02:30 AM |
| Euclid Algorithm (extended)Part2 Doubt about pointers - INITIALIZATION | nacho4d | C Programming | 4 | 12-10-2006 07:08 PM |
| Binary Search Trees Part III | Prelude | A Brief History of Cprogramming.com | 16 | 10-02-2004 03:00 PM |
| Request for comments | Prelude | A Brief History of Cprogramming.com | 15 | 01-02-2004 10:33 AM |