3June(III),java

public class NearestLowestAndGreatest {
    

    public static void main(String[] args) {
        int[] arr = {10,20,30,40,50,60,70,80};
        int search  =72;
        //TC  = O(n)
        int low =0;
        int mid = 0;
        int nearestLowest = 0;
        int nearestGreatest = 0;
        int high = arr.length -1 ;
        for(int i=0;i<arr.length; i++){
            mid = (low+high)/2;

            if(search>arr[mid]){
                low = mid+1;
                nearestLowest=arr[mid];
            }
            else if(search<arr[mid]){
                high=mid-1;
                nearestGreatest=arr[mid];
            }
            else{
                nearestGreatest = nearestLowest = arr[mid];
                break;
            }
            
        }

        System.out.println(nearestGreatest);
        System.out.println(nearestLowest);
    }
}