# recursive pseudocode

I have been asked by my tutor to code this pseudocode that outputs all of the intermediate as well as the final values of a Greatest Common Divisor. The inputs a and b are nonnegative numbers.

EUCLID(a,b)
if b=0
then return a
else return EUCID(b, a mod b)

I am at a loss and would be grateful if anyone can help me.

Paul1
###### Who is Participating?

Commented:
It would be unethical for any of us to provide you with an answer.  But we can answer specific questions if you ask them.  If you attempt the problem and post your work, we can ofter suggestions and improvements.  but you have to give us something to work with.
0

Author Commented:
Yes, fair enough. This is the first time I have used this communication line.
I am working on other C++ tasks as well as a Software Engineering assignment.

It was foolhardy to expect an answer. I will attempt and perhaps repost.

Paul.
0

Commented:
You didn't have to accept that as "the" answer.  In fact you still don't.  When you have something (or have a specific question), post it as a comment here and I will be happy to help you.

I check in about every 2 hours during day time hours in the USA.
0

Author Commented:
Thank-you nietod. I am in London and am attempting a BTEC course in C++. The course is part-time, 3 hours on a Wednesday evening. The tutor is adequate and notes brief. I have no previous experience in coding so probably need extra help, but at this stage the resources are less than at under grad level where there seemed plenty.
Here is what I have got:

#include <iostream.h>
#include <math.h>

int main()
{
int array[2], *p;
p=array;
int i=0;

cout<<"Enter two nonnegative numbers: "<<endl;
for (i=0;i<2;i++)
{
cin>>array[i]; //I haven't included proviso to check +ve yet
}
while(*p++)
{
cout<<p;  //This outputs the two numbers input plus almost two lines of }  //numbers(???).  I want to find the largest of the two input and could use
//eg if(x>y)
return x;
else
return y;

I wanted to assign pointers to the array eg array[0], *x; and array[1], *y;
- cannot work this out.

If I could do that I wanted to work out which is the largest - if one was zero then the other would be the GCD.

If x
0

Author Commented:
I appear to have run out of room. Here goes again.

If x
0

Author Commented:
I appear to have run out of room. Here goes again.

If x
0

Commented:
I am confussed (hopefully that doesn't make two of us).  Is the above code for the EUCLID() algorithm?  It doesn't seem like it.  It could be to get information for running the euclid algorithm,.  Is that it?

Its such a mess, I'm not sure where to begin.

What are you hopping to do with the array called "array"?
and what about the pointer p?

If you are having trouble posting comments here.  (It seems like it fromt he last two)  E-mail me the code at nietod@theshop.net.

0

Author Commented:
Thank-you for your reply. I am going to swop over to E-mail where there may be more room to finish what I wanted to say.
See you there.

Paul.
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.