diff --git a/binarysearch.java b/binarysearch.java
new file mode 100644
index 0000000..3784d02
--- /dev/null
+++ b/binarysearch.java
@@ -0,0 +1,30 @@
+class Binarysearch {
+    int binarySearch(int arr[], int l, int r, int x)
+    {
+        if (r >= l) {
+            int mid = l + (r - l) / 2;
+  
+            if (arr[mid] == x)
+                return mid;
+
+            if (arr[mid] > x)
+                return binarySearch(arr, l, mid - 1, x);
+  
+            return binarySearch(arr, mid + 1, r, x);
+        }
+
+        return -1;
+    }
+    public static void main(String args[])
+    {
+        BinarySearch ob = new BinarySearch();
+        int arr[] = { 2, 3, 4, 10, 40 };
+        int n = arr.length;
+        int x = 10;
+        int result = ob.binarySearch(arr, 0, n - 1, x);
+        if (result == -1)
+            System.out.println("Element not present");
+        else
+            System.out.println("Element found at index " + result);
+    }
+}
\ No newline at end of file
diff --git a/bubblesort.java b/bubblesort.java
new file mode 100644
index 0000000..7a5e381
--- /dev/null
+++ b/bubblesort.java
@@ -0,0 +1,14 @@
+ static void bubbleSort(int[] arr) {  
+        int n = arr.length;  
+        int temp = 0;  
+         for(int i=0; i < n; i++){  
+                 for(int j=1; j < (n-i); j++){  
+                          if(arr[j-1] > arr[j]){  
+                                 //swap elements  
+                                 temp = arr[j-1];  
+                                 arr[j-1] = arr[j];  
+                                 arr[j] = temp;  
+                         }      
+                 }  
+         }  
+    }  
\ No newline at end of file