java find highest common factor code example
Example 1: greatest common divisor java
import java.util.Scanner;
public class GCDExample3 {
public static void main(String[] args) {
int num1, num2;
Scanner scanner = new Scanner(System.in);
System.out.print("Enter first number:");
num1 = (int)scanner.nextInt();
System.out.print("Enter second number:");
num2 = (int)scanner.nextInt();
scanner.close();
while (num1 != num2) {
if(num1 > num2)
num1 = num1 - num2;
else
num2 = num2 - num1;
}
System.out.printf("GCD of given numbers is: %d", num2);
}
Example 2: a recursive function that calculates the greatest common divisor from user's input in java
public class gcf {
public static void main (String[]args){
Scanner input = new Scanner (System.in);
System.out.println("Please enter the first integer: ");
int a = input.nextInt();
System.out.println("Please enter a second interger: ");
int b = input.nextInt();
Divide(a,b);
}
public static void Divide(int a, int b) {
int temp;
if (b > a) {
temp = a;
a = b;
b = temp;
}
while (b !=0) {
temp = a%b;
a =b;
b =temp;
}
System.out.println(a);
}
}