I have been doing some research but I am not that good at writing C++ programs.
The only thing I have found is this:
int gcd( int num1, int num2 )
{
int remainder = num2 % num1;
if ( remainder != 0 )
return gcd( remainder,num1 );
return num1;
}
(Euclid's Algorithm)
Now how would I implement that so I could make a whole program?
C++ program to simplify fractions?
Already answered on here.
http://answers.yahoo.com/question/index?...
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment