Related

Thursday, October 14, 2010

int a in Boyle heights

int a in Boyle heights


Write an interactive computer program that wil find the greatest comon divisor of two integers using Euclid's Algorithm. If the remainder is not zero, replace the original two numbers by the remainder and the smaler of the two numbers, and repeat the division. Alocate storage for variables A, B, Remainder Input A, B IF A ! 0 / make sure you are not dividing anything by 0 while Remainder ! int a int a in Boyle heights
remainder Tags: int a

No comments:

Get more: