Binary Search (Sorted Array)

import java.util.*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr = new int[n];
for(int i = 0; i < n; i++)
arr[i] = sc.nextInt();
int key = sc.nextInt();
int low = 0, high = n - 1;
boolean found = false;
while(low <= high){
int mid = (low + high) / 2;
if(arr[mid] == key){
found = true;
break;
}
else if(arr[mid] < key)
low = mid + 1;
else
high = mid - 1;
}
System.out.println(found ? "Found" : "Not Found");
}
}