From c9d70b3eff2084504121e6e3ce623b4547c7a128 Mon Sep 17 00:00:00 2001
From: "Udaya Krishnan.M" <101326005+UdayaKrishnanM@users.noreply.github.com>
Date: Tue, 31 Jan 2023 02:03:09 +0530
Subject: [PATCH] Create OrderAgnosticBinary Search.java

---
 .../searching/OrderAgnosticBinary Search.java | 43 +++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 algorithms/Java/searching/OrderAgnosticBinary Search.java

diff --git a/algorithms/Java/searching/OrderAgnosticBinary Search.java b/algorithms/Java/searching/OrderAgnosticBinary Search.java
new file mode 100644
index 00000000..8c543af5
--- /dev/null
+++ b/algorithms/Java/searching/OrderAgnosticBinary Search.java	
@@ -0,0 +1,43 @@
+public class OrderAgnosticBS {
+    public static void main(String[] args) {
+        int[] arr={1,2,3,4,5,6,7,8,9};
+        int target=7;
+        int ans=orderAgnosticBS(arr,target);
+        System.out.println(ans);
+    }
+    static int orderAgnosticBS(int[] arr,int target){
+        int start=0;
+        int end=arr.length-1;
+        //find arr sorted in ascend or descend order
+        boolean isAsc;// boolean isAsc = arr[start]<arr[send];
+        if(arr[start]<arr[end]){
+            isAsc=true;
+        }
+        else{
+            isAsc=false;
+        }
+        while(start<=end){
+            int mid=start+(end-start)/2;
+            if(arr[mid]==target){
+                return mid;
+            }
+            if(isAsc) {
+                if(arr[mid]>target) {                  
+                    end=mid-1;
+                }
+                else if(arr[mid]<target){
+                    start=mid+1;
+                }
+            }
+            else{
+                if(arr[mid]<target) {
+                    end=mid-1;
+                }
+                else if(arr[mid]>target){
+                    start=mid+1;
+                }
+            }
+        }
+        return -1;
+    }
+}