-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBsearch.java
More file actions
56 lines (41 loc) · 1.06 KB
/
Bsearch.java
File metadata and controls
56 lines (41 loc) · 1.06 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
package com.chen.test;
/**
* @author : chen weijie
* @Date: 2020-04-22 07:18
*/
public class Bsearch {
public int search(int[] array, int target, int high, int low) {
if (array.length == 0) {
return -1;
}
if (low > high) {
return -1;
}
int mid = high - (high - low) >>> 1;
if (target > array[mid]) {
low = mid + 1;
search(array, target, high, low);
} else if (target < array[mid]) {
high = mid - 1;
search(array, target, high, low);
} else {
return mid;
}
return -1;
}
public int search2(int[] array, int target) {
int high = array.length - 1;
int low = 0;
int mid = high - (high - low) >>> 1;
while (high > low) {
if (target > array[mid]) {
low = mid + 1;
} else if (target < array[mid]) {
high = mid - 1;
} else {
return mid;
}
}
return -1;
}
}