Problem:
java
public class Solution {
public int searchInsert(int[] nums, int target)
{
int index = 0;
for(int i =0;i<nums.length;i++)
{
if(nums[i] == target)
{
index = i;
break;
}
else if(target>nums[i])
{
index++;
}
else
{
break;
}
}
return index;
}
}
