Q:

Java - Greatest Common Divisor or Euclidean Algorithm Program or Highest Common Divisor

belongs to collection: Java Basic Programs

mahmoud2506
Save to bookmark
|
2022-05-06
|
  298 
0

Java - Greatest Common Divisor or Euclidean Algorithm Program or Highest Common Divisor

Java programming, exam questions, Java programming exam-questions,
login and add your own answer to this question

All Answers

mahmoud2506
2022-05-06
need an explanation for this answer? contact us directly to get an explanation for this answer

Greatest Common Divisor / Euclidean Algorithm Program / Highest Common Divisor

public class Gcd {
    //  greatest common divisor
    public static int gcd(int First_number, int Second_number) {
        int i = First_number % Second_number;
            while (i != 0) {
            First_number = Second_number;
            Second_number = i;
            i = First_number % Second_number;
        }
        return Second_number;
    }
  
    public static void main(String[] args) {     
        Scanner sc=new Scanner(System.in);
 
        System.out.print("First Number  :");
        int num1=sc.nextInt();
        System.out.print("Second Number :");
        int num2=sc.nextInt();
 
        System.out.println("Greatest Common Divisors: " + gcd(num1,num2));
       
    }
}

Output

    First Number  :24
    Second Number :16
    Greatest Common Divisors: 8

 

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

Java Basic Programs
This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now
Java - Greatest Common Factor or Euclidean Algorit... >>
<< Java - Calculate Compound Interest using Java Prog...