-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathOrderAgnosticBS.java
More file actions
63 lines (38 loc) · 1.17 KB
/
Copy pathOrderAgnosticBS.java
File metadata and controls
63 lines (38 loc) · 1.17 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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
package com.binarySearch;
public class OrderAgnosticBS {
public static void main(String[] args) {
// int[] arr = {-1, 0, 1, 2, 34, 40, 50, 90};
int[] arr = {90, 80, 40, 20, 10, 4, 2, 0};
int target = 40;
int ans = orderAgnosticBS(arr, target);
System.out.println(ans);
}
static int orderAgnosticBS(int[] arr, int target){
int start = 0;
int end = arr.length - 1;
boolean isAscending = arr[end] > arr[start];
// while start is not greater than end
while(start <= end){
// better way to find the mid
int mid = start + (end - start) / 2;
// target is greater than mid
if(arr[mid] == target){
return mid;
}
if(isAscending){
if(target > arr[mid]){
start = mid + 1;
} else{
end = mid - 1;
}
}else{
if(target < arr[mid]){
start = mid + 1;
} else{
end = mid - 1;
}
}
}
return -1;
}
}