The point is, if we if we didn't found the position, there will be a 'n = numsSize'.

```
int searchInsert(int* nums, int numsSize, int target) {
int i;
int n = numsSize;
for(i = 0 ; i < numsSize; i ++)
{
if(nums[i] >= target)
{
n = i;
break;
}
}
return n;
}
```