,

 
import java.util.Scanner;
public class BinarySearch 
{
public static void main(String[] args) 
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter the number of elements: ");
int n = sc.nextInt();
double[] values = new double[n];
System.out.println("Enter the sorted elements of the array:");
for (int i = 0; i < n; i++) {
values[i] = sc.nextDouble();
}
System.out.print("Enter the value to search: ");
double searchValue = sc.nextDouble();
int low = 0;
int high = n - 1;
boolean found = false;
while (low <= high) 
{
int mid = (low + high) / 2;
if (values[mid] == searchValue) 
{
    found = true;
    break;
} 
else if (values[mid] < searchValue) 
{
    low = mid + 1;
} 
else 
{
    high = mid - 1;
}
}
if (found) {
System.out.println("Search successful");
} else {
System.out.println("Search element not found");
}
}
}