Tuesday
May 26, 2015

Homework Help: pseudo code and flow charts

Posted by ravindu on Friday, June 8, 2007 at 6:13am.

how can write a pseudo code and a flow charts to solve these?
1 to find the greatest common divisor out of two positive integers.
2 to find the smallest common factor out of two positive intrgers.

Write the flow of thinking just as you do it in your head. Work thru a sample problem on paper, then model your process as a flow chargt.

Note that you can define the greatest common divisor function recursively:

GCD[x,y] = GCD[y Mod x,x]

And GCD[0,x] = x

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

Members