Untitled

import java.util.Scanner;

class Main {
    public static int LinearSearch(int[] arr, int tar){
        int size = arr.length;

        for(int idx = 0; idx<size; idx++){
            if(arr[idx] == tar){
                return idx;
            }
        }

        return -1;
    }

    public static int BinarySearch(int[] arr, int tar){
        int size = arr.length;

        int l = 0;
        int r = size - 1;

        while(l <= r){
            int mid = (l+r)/2;

            if(arr[mid]  == tar){
                return mid;
            } else if(arr[mid] < tar){
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }

        return -1;
    }



    public static void main(String[] args) {
        int[] arr = {10, 14, 15, 9, 8, 11};

        System.out.println(search(arr,45));
    }
}