GCD-euclid-algo

import java.util.Scanner;

public class GCD {
    public static void main (String[] args) {
        Scanner input = new Scanner(System.in);
        System.out.println("Give me 2 numbers for GCD question: ");
        int x = input.nextInt();
        int y = input.nextInt();
        int z = euclidgcd(x,y);
        System.out.println("GCD of "  + x + " and " + y + " are " + z);
    }
    
    public static int euclidgcd(int a, int b) {
        int divisor = a < b?a : b; // if True it will return "a" if False will return "b"
        int dividend = a < b?b:a;
        int remainder = dividend % divisor;
        while (remainder !=0) {
            dividend = divisor;
            divisor = remainder;
            remainder = dividend%divisor;
       }
        return divisor;
    }
  }