forked from utkarsh-shekhar/basic-programs
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGCD.java
More file actions
42 lines (31 loc) · 830 Bytes
/
GCD.java
File metadata and controls
42 lines (31 loc) · 830 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
import java.util.Scanner;
/*
* Find the Greatest Common Dividor of 2 numbers
*/
class GCD {
public static void main(String[] args) {
int num1 = 0, num2 = 0;
// Accept input from the console
System.out.println("Enter 2 integers:");
try {
Scanner scanner = new Scanner(System.in);
// Gets the two inputs as integers
num1 = scanner.nextInt();
num2 = scanner.nextInt();
scanner.close();
// Calls the gcd function
System.out.println("The GCD is: " + gcd(num1, num2));
} catch (Exception e) {
// Display error message here
System.out.println("Error whilst reading user input");
}
}
// The gcd recursive function
public static int gcd(int a, int b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
}