Jump to content
  • Advertisement


This topic is now archived and is closed to further replies.



This topic is 6177 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Guest Anonymous Poster
This function would probably be extremely slow but heres one solution I think

int numerator, denomenator; // set these to something
int smallest; // holds the smaller of the two variables
int gcf; // greatest common factor

// determine which number is smallest, doesn''t matter if equal
if ( numerator >= denomenator )
{ smallest = numerator; }
{ smallest = denomenator; }

for ( int i = smallest; i > 0; i++ )
// if both numbers divide evenly, then it is divisible by i
if ( ( numerator % i == 0 ) && ( denomenator % i == 0 ))
{ gcf = i; }

I''m still learning C++ so if there are any more complex functions to do this I am unaware of them.

Share this post

Link to post
Share on other sites
Here''s some source code I made a while ago:
// Utilities

void rational::simplify() // Simplify rational

double x=gcd(num, denom);

long rational::gcd(long x, long y) // Find greatest common divisor

x=labs(x); // long absolute value

while(x != y)

Share this post

Link to post
Share on other sites

  • Advertisement

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!