Euclid's Algorithm for finding GCD(33,12)=3

Q A
2
1
3
X

Euclid's Algorithm for finding GCD(750,900)=150

Q A
1
5
X

Euclid's Algorithm for finding GCD(252,105)=21

Q A
2
2
2
X

Extended Euclidean Algorithm for finding

Q A
2
3

T1=0,T2=1,T=T1-
(T2*Q)=-2,
1-((-2)*3)=7
T1=T2
T2=T.
Extended
GCD=(A*T1)+
(B*T2)
=(35*1)+(15*-2)

=35-30=5
import java.util.*;
class Main{
public static int
GCD(int a,int b,int
x,int y,int arr[])
{

if (b==0)
{
int
result=(arr[0]*x)+
(arr[1]*y);
System.out.
println("Extended
GCD "+result);
return a;
}
else
{
int q=a/b;
int r=a%b;
int t=x-
(y*q);
if (r!=0)
return
GCD(b,r,y,t,arr);
else
return
GCD(b,r,x,y,arr);

}
}
public static void
main(String[] args)
{
int x=0,y=1,a,b;
Scanner
input=new
Scanner(System.in
);
int
A=input.nextInt();
int
B=input.nextInt();
if( A>B)
{
 a=A;
b=B;
}
else
{
a=B;
b=A;
}
int[] arr=new
int[2];
arr[0]=a;
arr[1]=b;