-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinarySearch.java
More file actions
49 lines (45 loc) · 1.24 KB
/
Copy pathBinarySearch.java
File metadata and controls
49 lines (45 loc) · 1.24 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
import java.util.Scanner;
import java.util.Arrays;
public class BinarySearch {
static void searchElement(int a[]){
Scanner sc= new Scanner(System.in);
System.out.print("Search: ");
int target= sc.nextInt();
int li= 0;
int hi= a.length-1;
int mid= (li+hi)/2;
while(li<=hi){
if(a[mid]==target){
System.out.println(mid);
break;
}
else if(a[mid]<target){
li=mid+1;
}
else if(a[mid]>target){
hi=mid-1;
}
mid= (li+hi)/2;
}
}
static void display(int a[]){
for(int i=0; i<a.length; i++){
System.out.print(a[i] + " ");
}
}
public static void main(String[] args) {
Scanner sc= new Scanner(System.in);
//INPUT ARRAY SIZE AND ELEMENTS
System.out.print("Enter array size: ");
int size= sc.nextInt();
int arr[]= new int[size];
System.out.print("Enter array elements: ");
for(int i=0; i<arr.length; i++){
arr[i]= sc.nextInt();
}
Arrays.sort(arr);
display(arr);
System.out.println();
searchElement(arr);
}
}