Jump to content

Maximo divisor comum


Recommended Posts

Só sei fazer recursivamente com ciclo também dá mas é mais complicado.

public int mdc( int x, int y ){
        if(x == y){
            return x;
        else if( y > x ){
            return mdc( x, y-x );
        else if( x > y ){
            return mdc( x - y, y );
        return 0;

I haven’t lost my mind; it’s backed up on DVD somewhere!

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

  • Create New...

Important Information

By using this site you accept our Terms of Use and Privacy Policy. We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.