From 7d7c5fe1f3e06c5faf6454dc76a7eeb5ce1db4b2 Mon Sep 17 00:00:00 2001
From: Sarvadnya Awaghad
 <111975266+Sarvadnyaawaghad150503@users.noreply.github.com>
Date: Thu, 12 Oct 2023 20:22:14 +0530
Subject: [PATCH] Create BinarySearch.java

---
 BinarySearch.java | 34 ++++++++++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 BinarySearch.java

diff --git a/BinarySearch.java b/BinarySearch.java
new file mode 100644
index 0000000..1cc5cc3
--- /dev/null
+++ b/BinarySearch.java
@@ -0,0 +1,34 @@
+
+public class p1BinarySearch {
+    public static void main(String[] args) {
+int [] nums = {-25 ,-11, -10, -4, 0,5, 12, 14, 23, 34, 56, 78,80, 98,100,};
+int target = 14;
+int ans = binarysearch(nums, 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)/2
+//            for big arrays we can use
+            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;
+
+    }
+}