class Solution {
    public int searchInsert(int[] nums, int target) 
    {
        int start=0;
        int end=nums.length-1;
        int ans=-1;
        while(start<=end){
            int mid=(start+end)/2;
            if(nums[mid]==target){
                return mid;
            }else if(nums[mid]<target){
                start=mid+1;
            }else{
                ans=mid;
                end=mid-1;
            }
        }
        if(ans==-1){
            return nums.length;
        }else
        return ans;  
    }
}
===============================================================
import java.util.* ;
import java.io.*; 

public class Solution {
    public static int[] getFloorAndCeil(int[] arr, int n, int target) {
      // Wriute your code here.
       int start=0;
        int end=arr.length-1;
        int ans=-1;
        boolean found=false;
        while(start<=end){
            int mid=(start+end)/2;
            if(arr[mid]==target){
               ans=mid;
               found=true;
               break;
            }else if(arr[mid]<target){
                start=mid+1;
            }else{
                ans=mid;
                end=mid-1;
            }
        }
        if(found==true){
            int nums[]=new int[2];
            nums[0]=arr[ans];
            nums[1]=arr[ans];
            return arr;
        }else{
            int nums[]=new int[2];
            nums[0]=arr[ans-1];
            nums[1]=arr[ans+1];
            return arr;
        }

    }
    
}
======================================================================