forked from ossamamehmood/Hacktoberfest
-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinarySearch.java
43 lines (40 loc) 路 1.14 KB
/
BinarySearch.java
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
public class BinarySearch {
public static int binarySearch(int arr[],int element){
int low =0;
int high = arr.length-1;
while(low<=high){
int mid = low-(low-high)/2;
if(arr[mid]==element){
return mid;
} else if (arr[mid]>element) {
high = mid-1;
}else{
low=mid+1;
}
}
return -1;
//Time Complexity
//O(logn)
}
//Using recursion
public static int binarySearchRecursion(int arr[],int l,int r,int element){
if(l>r){
return -1;
}
int mid = l-(l-r)/2;
if(arr[mid]==element){
return mid;
} else if (arr[mid]>element) {
return binarySearchRecursion(arr,l,mid-1,element);
}else{
return binarySearchRecursion(arr,mid+1,r,element);
}
//Time Complexity
//O(logn)
}
public static void main(String[] args) {
int arr[] = {1,2,3,4,5};
System.out.println(binarySearch(arr,2));
System.out.println(binarySearchRecursion(arr,0,arr.length-1,2));
}
}