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

3 votes165 views1 answer
Open link in android studio
Java
0 vote183 views1 answer
TestException = com.fasterxml.jackson.databind.exc.UnrecognizedPropertyException: Unrecognized field
Java
1 vote165 views3 answers
Get app version android
Java
13 votes158 views3 answers
Date and time java
Java
13 votes154 views2 answers
Java version command
Java
0 vote162 views1 answer
Resultset previous
Java
0 vote258 views1 answer
Spring delete objest from database that are not in your object list
Java Spring
0 vote164 views1 answer
Find number of occurrences of a substring in a string java
Java
0 vote208 views1 answer
@bean annotation in spring boot
Java Spring
22 votes160 views5 answers
Binary Tree Height
Java