Tuesday

July 29, 2014

July 29, 2014

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

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

**Related Questions**

programming - Week 3 - Expand Pseudo Code The accounting office indicated the ...

Math - Hello i need some help writing a pseudo code equation. It is pretty basic...

Algorithm - write a pseudo code algorithm that will accept 20 numbers and finds ...

Algorithm - write a pseudo code algorithm that will accept the marks in a test ...

programming techniques - how do modular program work, can you show me an example...

computers - Develop an algorithm or write a pseudo-code that accepts as input ...

Compiler Construction - Given the following 3-address code 1: a = 1 2: b = 2 3: ...

compiler construction - Given the following 3-address code 1: a = 1 2: b = 2 3: ...

Data Structures and Algorithms - The "random" numbers produced by computers aren...

i need ur help in compiler construction - Q: Given the following 3-address code ...