| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/divScorp/Java-Programs/master/MathPrograms/GCDEuclid.java | [Back] [Original] |
package MathPrograms;
import java.util.Scanner;
//Euclid's Algorithm to calculate GCD of two numbers
public class GCDEuclid {
public static int gcd(int x, int y) {
int max,min;
if(x
| Web Proxy Viewer | New URL | Original Page |