New algorithms and problems added

Author: techie-khushdeep

src/algorithm/CalcExponential.java

@@ -0,0 +1,16 @@
+package algorithm;
+//To calculate exponential
+public class CalcExponential {
+    public static void main(String[] args) {
+       int factor=10,expo=3;
+        int result = 1;
+       while (expo!=0){
+           if(expo % 2 == 1){
+               result *= factor;
+           }
+           expo /= 2;
+           factor *= factor;
+       }
+        System.out.println(result);
+    }
+}

src/algorithm/Euclid_GCD.java

@@ -0,0 +1,19 @@
+package algorithm;
+
+public class Euclid_GCD {
+    public static void main(String[] args) {
+        int a = 105, b=350;
+        System.out.println(GCD(a, b));
+
+    }
+
+    public static int GCD(int a, int b) {
+        while( b !=0){
+            int reminder = a % b;
+            a = b;
+            b =reminder;
+        }
+
+        return a;
+    }
+}

src/algorithm/info.md

@@ -0,0 +1,3 @@
+Algorithm:
+* Calculate GCD
+* Calculate exponential

src/array/RotationArray.java

@@ -0,0 +1,50 @@
+package array;
+
+import algorithm.Euclid_GCD;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class RotationArray {
+    public static void printArray(int[] arr){
+        System.out.println(Arrays.toString(arr));
+    }
+    public static void simpleApproach(int[] input,int d){
+        for (int NumberOfInteration = 1; NumberOfInteration <=d; NumberOfInteration++) {
+            int value = input[0];
+            for (int movePosition = 1; movePosition <input.length ; movePosition++) {
+                input[movePosition-1] = input[movePosition];
+            }
+            input[input.length-1] = value;
+        }
+        printArray(input);
+    }
+    public static void jugglingAlgorithm(int[] input, int d){
+        d = d%(input.length);
+        int gcd = Euclid_GCD.GCD(input.length,d);
+        for (int set = 0; set <gcd ; set++) {
+            int temp = input[set];
+            int k = set;
+            while (true){
+                int position = (d+k)%(input.length);
+                if (position==set){
+                    input[position]= temp;
+                    break;
+                }else{
+                    input[k] = input[position];
+                }
+                k = position;
+            }
+        }
+        printArray(input);
+    }
+    public static void main(String[] args) {
+        int[] arr = {1,2,3,4,5,6,7};
+        Scanner input = new Scanner(System.in);
+        int d = input.nextInt();
+        printArray(arr);
+       // simpleApproach(arr,d);
+        jugglingAlgorithm(arr,d);
+
+    }
+}

src/problem/MaxSubArray.java

@@ -0,0 +1,23 @@
+package problem;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class MaxSubArray {
+    public static void main(String[] args) {
+        List<Integer> A = new ArrayList<>();
+        A.add(1);
+        A.add(2);
+        A.add(-4);
+        A.add(2);
+        A.add(2);
+
+        int maxEndingHere = A.get(0);
+        int maxSoFar = A.get(0);
+        for (int i = 1; i < A.size(); i++) {
+            maxEndingHere = Math.max(A.get(i), A.get(i) + maxEndingHere);
+            maxSoFar = Math.max(maxSoFar, maxEndingHere);
+        }
+        System.out.println(maxSoFar);
+    }
+}