Algoritimo de Euclides Estendido

EuclidesEstendido.groovy

//def mdc(a, b) { return (b == 0) ? a : mdc (b, a%b) }
//mdc 252, 105

def mdcx(a, b){
  
    def r=a; r1=b; u=1; v=0; u1=0; v1=1;
    def rs, us, vs, q;
    
    while ( r1 != 0 ) {
        q = r/r1 as int
        rs=r
        us=u
        vs=v
        r=r1
        u=u1
        v=v1
        r1=rs-q*r1
        u1=us-q*u
        v1=vs-q*v1 
    }
    [r, u, v]
    
}
mdcx 252, 105