Merge pull request #117 from adisiji/patch-2

Searching for GCD with Euclid in Java

Author: danielabrozzoni

Algorithms/Searching Algorithms/Greatest Common Divisor/Java/Euclid.java

@@ -0,0 +1,35 @@
+ /*  Reads two command-line arguments p and q and computes the greatest
+ *  common divisor of p and q using Euclid's algorithm.
+ *
+ *  Remarks
+ *  -----------
+ *    - may return the negative of the gcd if p is negative
+ */
+
+public class Euclid {
+
+    // recursive implementation
+    public static int gcd(int p, int q) {
+        if (q == 0) return p;
+        else return gcd(q, p % q);
+    }
+
+    // non-recursive implementation
+    public static int gcd2(int p, int q) {
+        while (q != 0) {
+            int temp = q;
+            q = p % q;
+            p = temp;
+        }
+        return p;
+    }
+
+    public static void main(String[] args) {
+        int p = Integer.parseInt(args[0]);
+        int q = Integer.parseInt(args[1]);
+        int d  = gcd(p, q);
+        int d2 = gcd2(p, q);
+        System.out.println("gcd(" + p + ", " + q + ") = " + d);
+        System.out.println("gcd(" + p + ", " + q + ") = " + d2);
+    }
+}