## [LeetCode] Search Insert Position

Search Insert Position

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

```class Solution {
public:
int searchInsert(int A[], int n, int target) {
int start=0, end = n-1;
int middle;
while(start <= end){
middle=(start+end)/2;
if(A[middle]==target){
return middle;
}
if(A[middle]>target){
end = middle-1;
}else{
start = middle + 1;
}
}
if(A[middle]>target){
return middle;
}else{
return middle+1;
}
}
};```

```class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int len = nums.size();
if(len == 0){
return 0;
}
int start = 0, end = len - 1;
int middle;
while(start <= end){
middle = (start + end) / 2;
if(nums[middle] == target){
return middle;
}else if(nums[middle] > target){
end = middle - 1;
}else{
start = middle + 1;
}
}
return nums[middle] > target ? middle : middle + 1;
}
};```