int searchInsert(int* nums, int numsSize, int target){
if(nums[0] >= target) return 0;
if(nums[numsSize-1] < target) return numsSize;
if(nums[numsSize-1] == target) return numsSize-1;
int i = 0, j = numsSize, binary = 0;
while(j - i > 1){
binary = floor((i + j) / 2) ;
if(nums[binary] == target) return binary;
else if(nums[binary] < target) i = binary;
else j = binary;
}
return i+1;
}