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

Java Solution

public class Solution {
public int searchInsert(int[] nums, int target) {
int front = 0, end = nums.length - 1, mid;

while (front <= end) {
mid = (front + end) / 2;
if (target == nums[mid])
return mid;
else if (target > nums[mid])
front = mid + 1;
else
end = mid - 1;
}
return front;
}
}