GCD of two numbers in JAVA

Author: AnupKumarGupta

gcd/gcd.java

@@ -0,0 +1,27 @@
+// Java program to find factorial of given number
+class gcd
+{
+    // Recursive function to return gcd of a and b
+    static int gcd(int a, int b)
+    {
+        // Everything divides 0 
+        if (a == 0 || b == 0)
+           return 0;
+      
+        // base case
+        if (a == b)
+            return a;
+      
+        // a is greater
+        if (a > b)
+            return gcd(a-b, b);
+        return gcd(a, b-a);
+    }
+     
+    // Driver method
+    public static void main(String[] args) 
+    {
+        int a = 98, b = 56;
+        System.out.println("GCD of " + a +" and " + b + " is " + gcd(a, b));
+    }
+}