metodo de euclides java
DESCRIPTION
Codigo en Java del metodo de euclides, para implementar de modo graficoTRANSCRIPT
![Page 1: Metodo de Euclides JAVA](https://reader036.vdocuments.net/reader036/viewer/2022073101/55400d74550346a57f8b495d/html5/thumbnails/1.jpg)
int n1 = Integer.parseInt(num1.getText());int n2 = Integer.parseInt(num2.getText()); int res = 0;
if (n1 < 0) { n1 *= -1; } if (n2 < 0) { n2 *= -1; }
if (n1 == n2) { JOptionPane.showMessageDialog(num1, "Ambos numeros son iguales \nImposible obtener MCD"); num1.setText(null); num2.setText(null); //son iguales } else { if (n1 > n2) {
if (n2 == 0) { JOptionPane.showMessageDialog(num1, "Divisor no puede ser 0\nImposible obtener MCD"); num2.setText(null); } else {
res = n1 % n2; System.out.println(res); while (res != 0) {
n1 = n2; n2 = res; res = n1 % n2; System.out.println(res);
} resultado.setText(" " + n2); //codigo } //n1 es mayor } else { //n2 es mayor if (n1 == 0) { JOptionPane.showMessageDialog(num1, "Divisor no puede ser 0\nImposible obtener MCD"); num1.setText(null); } else {
res = n2 % n1; while (res != 0) {
n2 = n1; n1 = res; res = n2 % n1;
![Page 2: Metodo de Euclides JAVA](https://reader036.vdocuments.net/reader036/viewer/2022073101/55400d74550346a57f8b495d/html5/thumbnails/2.jpg)
} resultado.setText(" " + n1); //codigo } } }