-
Notifications
You must be signed in to change notification settings - Fork 4
/
BinarySearch.java
39 lines (36 loc) · 1.03 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
import java.util.Scanner;
class BinarySearch {
int binarySearch(int array[], int element, int low, int high) {
while (low <= high) {
int mid = low + (high - low) / 2;
if (array[mid] == element)
return mid;
if (array[mid] < element)
low = mid + 1;
else
high = mid - 1;
}
return -1;
}
public static void main(String args[]) {
BinarySearch obj = new BinarySearch();
Scanner input = new Scanner(System.in);
int[] array = new int[30];
int n, j;
System.out.println("Enter the array size: ");
n = input.nextInt();
int i;
System.out.println("Enter the elements in ascending order: ");
for (i = 0; i < n; i++) {
array[i] = input.nextInt();
}
System.out.println("Enter element to be searched:");
int element = input.nextInt();
input.close();
int result = obj.binarySearch(array, element, 0, n - 1);
if (result == -1)
System.out.println("Not found");
else
System.out.println("Element found at index " + result);
}
}