JavaProgramming/Function/GreatestCommonDivisor.java at main · Sbiswas001/JavaProgramming · GitHub

24 lines (18 loc) · 517 Bytes

//Write a function that calculates the Greatest Common Divisor of 2 numbers.

package Function;

import java.util.Scanner;

public class GreatestCommonDivisor {

public static void main(String args[]) {

Scanner sc = new Scanner(System.in);

int n1 = sc.nextInt();

int n2 = sc.nextInt();

while(n1 != n2) {

if(n1>n2) {

n1 = n1 - n2;

} else {

n2 = n2 - n1;

}

System.out.println("GCD is : "+ n2);

}

Expand file tree