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

簡單的二分法，如果是返回mid或left 

 int searchInsert(int A[], int n, int target) 
    {
    	if(n <= 0)return -1;
    	
    	int right = n-1;
    	int left = 0;
    	int mid;
    
    	while(left <= right)
    	{
    		mid = (left + right)/2;
    
    		if (A[mid] == target)
    		{	
    			return mid;
    		}
    		else if(A[mid] > target)
    		{
    			right = mid -1;
    		}
    		else
    		{
    			left = mid + 1;
    		}
    	}
    	return left;
    }