Searching

import java.util.Scanner;
public class Sample {
    public static int linearSearch(int[] data,int target){
        for(int i=0;i<data.length;i++){
            if(data[i]==target){
                return i;
            }
        }
        return -1;
    }

    public static int binarySearch(int[] data,int target){
        int start = 0;
        int end = data.length-1;
        while(start<=end){
            int mid = (start+end)/2;
            if(data[mid]==target){
                return mid;
            }
            if(target>data[mid]){
                start = mid+1;
            }
            if(target<data[mid]){
                end = mid-1;
            }
        }
        return -1;
        
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int x;
        int n = sc.nextInt();
        int arr[] = new int[n];
        for(int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        x = sc.nextInt();
        # int res = linearSearch(arr, x);
        int res = binarySearch(arr, x);
        System.out.println(res);
        
    }
}