diff --git a/Java/BinarySearch.java b/Java/BinarySearch.java
new file mode 100644
index 0000000..450f304
--- /dev/null
+++ b/Java/BinarySearch.java
@@ -0,0 +1,31 @@
+ //Link:https://leetcode.com/problems/binary-search/
+
+ public class BinarySearch {
+
+    public static void main(String[] args) {
+        int[] arr = {-18, -12, -4, 0, 2, 3, 4, 15, 16, 18, 22, 45, 89};
+        int target = 22;
+        int ans = binarySearch(arr, target);
+        System.out.println(ans);
+    }
+
+    static int binarySearch(int[] arr, int target) {
+        int start = 0;
+        int end = arr.length - 1;
+
+        while(start <= end) {
+        
+            int mid = start + (end - start) / 2;
+
+            if (target < arr[mid]) {
+                end = mid - 1;
+            } else if (target > arr[mid]) {
+                start = mid + 1;
+            } else {
+                return mid;
+            }
+        }
+        return -1;
+    }
+}
+
diff --git a/Java/README.md b/Java/README.md
index 9b64e83..1de5999 100644
--- a/Java/README.md
+++ b/Java/README.md
@@ -5,3 +5,4 @@
 1 : Two Sum<br>
 7 : Reverse Integer<br>
 9 : Palindrome Number<br>
+704: Binary Search<br>