diff --git a/Array_Rotate.java b/Array_Rotate.java
new file mode 100644
index 0000000..3fb9399
--- /dev/null
+++ b/Array_Rotate.java
@@ -0,0 +1,43 @@
+//program for array rotation in java
+
+import java.util.*;
+public class Array_Rotate {
+
+    static void leftRotate(int arr[], int arr1[]){
+        for (int i=0;i<arr1[1];i++){
+            leftRotate1by1(arr,arr1);
+        }
+    }
+    static void leftRotate1by1(int arr[],int arr1[]) {
+        int i, temp;
+        temp = arr[0];
+        for (i = 0; i < arr.length - 1; i++) {
+            arr[i] = arr[i + 1];
+        }
+        arr[i] =temp;
+    }
+
+    static void printArray(int arr[], int n){
+        for (int i=0;i<arr.length;i++) {
+            System.out.print(arr[i]+ " ");
+        }
+        System.out.println();
+    }
+
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t=sc.nextInt();		// number of test cases
+        int arr1[] = new int[2];
+        for (int i=0;i<t;i++) {
+             arr1[0] = sc.nextInt();
+             arr1[1]=sc.nextInt();
+            int arr[] = new int[arr1[0]];
+            for (int j = 0; j < arr.length; j++) {
+                arr[j]=sc.nextInt();	// array input 
+            }
+            Array_Rotate.leftRotate(arr,arr1);
+            Array_Rotate.printArray(arr, arr1[0]);
+        }
+    }
+}
+
diff --git a/BinarySearch.java b/BinarySearch.java
new file mode 100644
index 0000000..3b38285
--- /dev/null
+++ b/BinarySearch.java
@@ -0,0 +1,32 @@
+import java.util.*;
+class BinarySearch {
+    static int binarySearch(int arr[], int left, int right, int element) {
+        if (right >= left) {
+            int mid = left + (right - left) / 2;
+            if (arr[mid] == element)
+                return mid;
+
+            if (arr[mid] > element)
+                return binarySearch(arr, left, mid - 1, element);
+
+            return binarySearch(arr, mid + 1, right, element);
+        }
+        return -1;
+    }
+
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();       // defines the length of array
+        int arr[] = new int[n];
+        for (int i = 0; i <n; i++) {
+            arr[i] = sc.nextInt();  // user input
+        }
+        int element = sc.nextInt(); // element to find its index in the given array
+        int result = binarySearch(arr, 0, n - 1, element);
+        if (result == -1)
+            System.out.println("Element not present in the given array");
+        else
+            System.out.println("Element found at index " + result);
+    }
+}
+