-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinarySearch.java
More file actions
34 lines (26 loc) · 865 Bytes
/
BinarySearch.java
File metadata and controls
34 lines (26 loc) · 865 Bytes
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
package com.binary;
public class BinarySearch {
static int binarySearch(int arr[],int target) {
int start =0;
int end = arr.length-1;
while(start<=end) {
// find the middle element
// int mid = (start + end) / 2; // might be possible that (start + end) exceeds the range of int in java
int mid = start+(end-start)/2;
if(target<arr[mid]) {
end = mid-1; // moving left of array because array is sorted in ascending order .
}else if(target>arr[mid]) {
start = mid+1; // moving right of array because array is sorted in ascending order .
}else {
return mid;
}
}
return -1;
}
public static void main(String[] args) {
int[] arr = {-18, -12, -4, 0, 2, 3, 4, 15, 16, 18, 22, 45, 89};
int target = 22;
int ans = binarySearch(arr, target);
System.out.println(ans);
}
}