Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

Β 

History

History
History
33 lines (24 loc) Β· 589 Bytes

File metadata and controls

33 lines (24 loc) Β· 589 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package Leetcode.Youtube;
public class BinarySearch {
public static int binarysearch(int[] arr, int value) {
int start = 0, end = arr.length - 1;
while (start <= end) {
int mid = start + (end - start) / 2;
if (arr[mid] == value) {
return mid;
} else if (arr[mid] > value) {
end = mid - 1;
} else {
start = mid + 1;
}
}
return -1;
}
public static void main(String[] args) {
int[] arr = { 1, 2, 3, 5, 6, 7, 8, 9, 12 };
for (int n : arr) {
System.out.println(binarysearch(arr, n));
}
System.out.println(binarysearch(arr, -2));
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.