class Solution {

    public int bSearch(int[] nums, int low, int high, int target) {
        int mid = (low+high)/2;
        if( low>=high ) {
            return high;
        }
        if( nums[mid] == target ) {
            return mid;
        } else if( nums[mid]>target ) {
            high = mid;
        } else {
            low = mid + 1;
        }
        return bSearch(nums, low, high, target);
    }

    public int searchInsert(int[] nums, int target) {
        int len = nums.length;
        int index = bSearch(nums, 0, len, target);
        return index;
    }
}