-
Notifications
You must be signed in to change notification settings - Fork 151
Expand file tree
/
Copy pathOrderAgnosticBS.java
More file actions
47 lines (38 loc) · 1.2 KB
/
OrderAgnosticBS.java
File metadata and controls
47 lines (38 loc) · 1.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
package com.viraj;
public class OrderAgnosticBS {
public static void main(String[] args) {
int[] arr = {-18, -12, -4, 0, 2, 3, 4, 15, 16, 18, 22, 45, 89};
int target = 5;
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 whether the array is sorted in ascending or descending.
boolean isAsc = arr[start] < arr[end];
while(start <= end){
//find the middle element
//int mid = (start + end) / 2; //might be possible that (start + end ) exceeds the range of int.
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;
}
}