https://leetcode.com/problems/search-insert-position/description/
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int i;
for(i=0;i<nums.size();i++){
if (nums[i] == target){
return i;
} else {
if(target<nums[i]){
return i;
}
}
}
return i;
}
};