LC: 35: Search Insert Position

func searchInsert(nums []int, target int) int {
    // array is sorted, binary search and return end+1
    
    var start, end, mid int
    end=len(nums)-1
    for start<=end {
        mid=(start+end)/2
        if nums[mid]==target{
            return mid
        }

        if nums[mid]<target{
            start=mid+1
        } else {
            end=mid-1
        }
    }

    return end+1
}