-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathupperAndLowerBound.java
More file actions
68 lines (62 loc) · 1.58 KB
/
Copy pathupperAndLowerBound.java
File metadata and controls
68 lines (62 loc) · 1.58 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
64
65
66
67
68
package templates;
import java.util.ArrayList;
public class upperAndLowerBound {
// strictly greater than key
public static int upperBound(long[] ar, long key,int s,int e) {
int ae=e;
while (s < e && s != ae) {
int mid = s + (e - s) / 2;
if (ar[mid] <= key)
s = mid + 1;
else
e = mid;
}
if (s == ae)
return -1;
else
return s;
}
public static int upperBound(ArrayList<Long> ar, long key,int s,int e) {
int ae=e;
while (s < e && s != ae) {
int mid = s + (e - s) / 2;
if (ar.get(mid) <= key)
s = mid + 1;
else
e = mid;
}
if (s == ae)
return -1;
else
return s;
}
// greater than or equal to key
public static int lowerBound(long[] ar, long key,int s,int e) {
int ae=e;
while (s < e && s != ae) {
int mid = s + (e - s) / 2;
if (ar[mid] < key)
s = mid + 1;
else
e = mid;
}
if (s == ae)
return -1;
else
return s;
}
public static int lowerBound(ArrayList<Long> ar, long key,int s,int e) {
int ae=e;
while (s < e && s != ae) {
int mid = s + (e - s) / 2;
if (ar.get(mid) < key)
s = mid + 1;
else
e = mid;
}
if (s == ae)
return -1;
else
return s;
}
}