euclids algoritm java gcd

1//Calculating GCD with euclid's algorithm using recursion
2
3public static int calcGCD(int num1, int num2) {
4		if (num2 == 0) {
5			return num1;
6		} else {
7			return calcGCD(num2, num1 % num2);
8		}
9	}