From 9947d86c968ccda0f499a28f528ce7b4a7d9971b Mon Sep 17 00:00:00 2001 From: sjmeans Date: Mon, 20 Nov 2023 19:13:03 -0800 Subject: [PATCH 1/2] finished --- .idea/misc.xml | 2 +- src/MyMath.java | 23 ++++++++++++++++++++++- 2 files changed, 23 insertions(+), 2 deletions(-) diff --git a/.idea/misc.xml b/.idea/misc.xml index d15472f..844b5c4 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -1,6 +1,6 @@ - + \ No newline at end of file diff --git a/src/MyMath.java b/src/MyMath.java index 7da9a29..718b5ae 100644 --- a/src/MyMath.java +++ b/src/MyMath.java @@ -1,7 +1,28 @@ import java.util.Scanner; public class MyMath { - + public static int gcf(int in1, int in2){ + int in3; + while(in2 != 0){ + if(in1 > in2) + in3 = in2; + else in2 = in2 % in1; + in3 = in2; + in2 = in1 % in2; + in1 = in3; + } + return in1; + } public static void main(String[] args) { + Scanner s = new Scanner(System.in); + int in1, in2; + + System.out.println("Please enter two integers to find their greatest common factor"); + System.out.print("First integer: "); + in1 = Integer.parseInt(s.nextLine()); + System.out.print("Second integer: "); + in2 = Integer.parseInt(s.nextLine()); + + System.out.printf("The greatest common factor of %d and %d is %d", in1, in2, gcf(in1, in2)); } } From 445e44e66d11fd2d2d4eaf5b10a6e83fab52dfe6 Mon Sep 17 00:00:00 2001 From: sjmeans Date: Mon, 20 Nov 2023 19:14:33 -0800 Subject: [PATCH 2/2] finished --- src/MyMath.java | 6 ++++++ 1 file changed, 6 insertions(+) diff --git a/src/MyMath.java b/src/MyMath.java index 718b5ae..28bb6da 100644 --- a/src/MyMath.java +++ b/src/MyMath.java @@ -1,6 +1,12 @@ import java.util.Scanner; public class MyMath { + /** + * A simple recreation of Euclid's GCF algorithm + * @param in1 First integer input + * @param in2 Second integer input + * @return The greatest common factor of in1 and in2 + */ public static int gcf(int in1, int in2){ int in3; while(in2 != 0){