Search Insert Position, insertposition

Search Insert Position, insertposition

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it wocould 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

 

1 int searchInsert (int * nums, int numsSize, int target) {2 int I; 3 4 for (I = 0; I <numsSize; I ++) 5 if (nums [I]> target) 6 break; 7 if (I = 0) 8 return I; 9 if (nums [I-1] = target) 10 return I-1; 11 else12 return I; 13}