ALGORITHMO #1 - Euclidean Algorithm Implementation

ALGORITHMO-1-Euclidean-Algorithm-Implementation.java

import java.util.Scanner;

public class Solution {
	
	public static int getGreatestCommonDivisor(int a, int b) {
		if (a == b) {
			return a;
		}
		while (a != b) {
			if (a > b) {
				a = a - b;
			}
			else {
				b = b - a;
			}
		}
		int greatestCommonDivisor = a;
		return greatestCommonDivisor;
	}

	public static void main(String[] args) {
		Scanner read = new Scanner(System.in);
		
		int a = read.nextInt();
		int b = read.nextInt();
		
		int greatestCommonDivisor = getGreatestCommonDivisor(a, b);
		
		System.out.println(greatestCommonDivisor);
		
		// Close scanner
		read.close();
	}

}