SearchInsertPosition.java

package binary_search;

/**
 * Created by gouthamvidyapradhan on 22/05/2017.
 Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

 You may assume no duplicates in the array.

 Here are few examples.
 [1,3,5,6], 5 → 2
 [1,3,5,6], 2 → 1
 [1,3,5,6], 7 → 4
 [1,3,5,6], 0 → 0
 */
public class SearchInsertPosition
{
    public static void main(String[] args) throws Exception
    {
        int[] A = {1, 3, 5, 6};
        new SearchInsertPosition().searchInsert(A, 5);
    }

    public int searchInsert(int[] nums, int target)
    {
        int pos = nums.length;
        int s = 0, e = nums.length - 1;
        while(s <= e)
        {
            int m = s + (e - s) / 2;
            if(nums[m] >= target)
            {
                pos = m;
                e = m - 1;
            }
            else s = m + 1;
        }
        return pos;
    }

}