ALGORITHMO #9 - Euclidean Algorithm Implementation

ALGORITHMO-9-Euclidean-Algorithm-Implementation.java

public class Solution {
	
	static int getGreatestCommonDivisor(int a, int b) {
		while (b != 0) {
			int temp = a;
			a = b;
			b = temp % b;
		}
		int greatestCommonDivisor = a;
		return greatestCommonDivisor;
	}
	
	public static void main(String[] args) {
		System.out.println(
			getGreatestCommonDivisor(2505, 9775)
		);
	}
  
}