completed

Author: pradeepkumar24rk

BasicJavaProblems/Factorial.java

@@ -0,0 +1,32 @@
+package BasicJavaProblems;
+
+public class Factorial {
+
+    static int withMultOperator(int n) {
+
+        System.out.println("With using Multiplication operator");
+        int sum = 1;
+        for (int i = 2; i <= n; i++)
+            sum *= i;
+        return sum;
+    }
+
+    static int withOutMultOperator(int n) {
+        System.out.println("Without using Multiplication operator");
+        int temp = n;
+        for (int i = n - 1; i > 0; i--) {
+            int sum = 0;
+            for (int j = 0; j < i; j++)
+                sum += temp;
+            // System.out.println(sum+" "+i);
+            temp = sum;
+        }
+        return temp;
+
+    }
+
+    public static void main(String[] args) {
+        System.out.println(withMultOperator(5));
+        System.out.println(withOutMultOperator(5));
+    }
+}

BasicJavaProblems/MaxRepeatedNumber.java

@@ -0,0 +1,30 @@
+package BasicJavaProblems;
+
+public class MaxRepeatedNumber {
+    public static void main(String[] args) {
+        int a[] = { 5, 1, 2, 6, 2, 5 }, max = Integer.MIN_VALUE;
+        for (int i = 0; i < a.length; i++)
+            if (max < a[i])
+                max = a[i];
+        // System.out.println(max);
+        int b[] = new int[max + 1];
+
+        for (int i = 0; i < a.length; i++) {
+            b[a[i]]++;
+        }
+
+        System.out.println("Counted :");
+        for (int i : b)
+            System.out.print(+i + " ");
+
+        System.out.println();
+        int MaxRepeatedNumberMin = 0, min = 0;
+        for (int i = 0; i < b.length; i++) {
+            if (MaxRepeatedNumberMin < b[i]) {
+                MaxRepeatedNumberMin = b[i];
+                min = i;
+            }
+        }
+        System.out.println("MaxRepeatedNumberMin " + min);
+    }
+}

BasicJavaProblems/gcd.java

@@ -0,0 +1,36 @@
+package BasicJavaProblems;
+
+public class gcd {
+
+    static int GeneralMethod(int a, int b) {
+        int gcd = 0;
+        for (int i = 1; i <= a && i <= b; i++) {
+            if (a % i == 0 && b % i == 0)
+                gcd = i;
+        }
+        return gcd;
+    }
+
+    static int eludienSub(int a, int b) {
+        if (b == 0)
+            return a;
+        else
+            return eludienSub(b, Math.abs(a - b));
+    }
+
+    static int eludienMod(int a, int b) {
+        if (b == 0)
+            return a;
+        else
+            return eludienSub(b, (a % b));
+    }
+
+    public static void main(String[] args) {
+        System.out.println("General Method :");
+        System.out.println(GeneralMethod(20, 30));
+        System.out.println("Eudien Algorithm(Subtraction)");
+        System.out.println(eludienSub(20, 30));
+        System.out.println("Eudien Algorithm(%)");
+        System.out.println(eludienMod(20, 30));
+    }
+}