question: recursively compute the greatest common divisor of two positive integers concode_field_sep int num concode_elem_sep int ans concode_elem_sep int den concode_elem_sep boolean multi concode_field_sep int getNumerator concode_elem_sep Rational add concode_elem_sep Rational invert concode_elem_sep Rational negate concode_elem_sep Rational subtract concode_elem_sep void normalize concode_elem_sep Rational divide concode_elem_sep Rational multiply concode_elem_sep int getDenominator
target: int function ( int arg0 , int arg1 ) { int loc0 = 0 ; if ( arg0 < arg1 ) loc0 = gcd ( arg1 , arg0 ) ; else if ( arg1 == 0 ) loc0 = arg0 ; else { int loc1 = arg0 % arg1 ; loc0 = gcd ( arg1 , loc1 ) ; } return loc0 ; }