Search in a mountain program added

SearchInMountain.java

@@ -0,0 +1,64 @@
+
+
+public class SearchInMountain {
+    public static void main(String[] args) {
+
+    }
+
+    int search(int[] arr, int target) {
+        int peak = peakIndexInMountainArray(arr);
+        int firstTry = orderAgnosticBS(arr, target, 0, peak);
+        if (firstTry != -1) {
+            return firstTry;
+        }
+
+        return orderAgnosticBS(arr, target, peak+1, arr.length - 1);
+    }
+
+    public int peakIndexInMountainArray(int[] arr) {
+        int start = 0;
+        int end = arr.length - 1;
+
+        while (start < end) {
+            int mid = start + (end - start) / 2;
+            if (arr[mid] > arr[mid+1]) {
+
+                end = mid;
+            } else {
+
+                start = mid + 1; 
+            }
+        }
+        return end;
+
+    }
+
+    static int orderAgnosticBS(int[] arr, int target, int start, int end) {
+
+        boolean isAsc = arr[start] < arr[end];
+
+        while(start <= end) {
+
+            int mid = start + (end - start) / 2;
+
+            if (arr[mid] == target) {
+                return mid;
+            }
+
+            if (isAsc) {
+                if (target < arr[mid]) {
+                    end = mid - 1;
+                } else {
+                    start = mid + 1;
+                }
+            } else {
+                if (target > arr[mid]) {
+                    end = mid - 1;
+                } else {
+                    start = mid + 1;
+                }
+            }
+        }
+        return -1;
+    }
+}