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

4 votes188 views2 answers
Array to set java
Java
6 votes205 views1 answer
Android studio webview mailto
Java
0 vote187 views2 answers
Failed to determine a suitable driver class
Java
0 vote198 views1 answer
How to install clojure on linux
Java
0 vote180 views1 answer
Java ordenar numeros ascendente
Java
1 vote175 views1 answer
Sc.nextline skips
Java
2 votes195 views1 answer
Show dialog fragment from adapter
Java
4 votes182 views2 answers
Dfhgodjfgiojdfiojgjkdhjbsdv JKNJZXcnmvmcvbpdfh
Java
1 vote183 views2 answers
How to do annotation configuration in spring
Java
3 votes310 views3 answers
Spring xml
Java Spring