Euclids algoritm java gcd

//Calculating GCD with euclid's algorithm using recursion

public static int calcGCD(int num1, int num2) {
		if (num2 == 0) {
			return num1;
		} else {
			return calcGCD(num2, num1 % num2);
		}
	}

Similar codes

6 votes128 views2 answers
How to set the java_home in mac
Java
0 vote153 views1 answer
Could not determine java version from
Java
0 vote153 views1 answer
How to sort a interable in java
Java
0 vote121 views1 answer
Add opacity to activity android
Java
0 vote147 views1 answer
Print java object inherited classes
Java
0 vote139 views1 answer
What Is Spring Boot and What Are Its Main Features?
Java Spring
2 votes136 views2 answers
How to split string in java android
Java
3 votes126 views2 answers
Portrait in manifest
Java
1 vote120 views1 answer
What AJAJ stand for
Java
0 vote127 views1 answer
Are classes in java public by default
Java