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

这个题目比较简单，也就是二分作一些处理。代码：

    int searchInsert(int A[], int n, int target) {
        return binarySearch(A,0,n-1,target);
    }
    int binarySearch(int A[],int s,int e,int target){
        while(s<=e){
            int mid=s+(e-s)/2;
            if(A[mid]==target) return mid;
            if(s==e) return A[mid]>target?s:s+1;
            if(target<A[mid]) {
                if(mid==s) return s;
                e=mid-1;
            }
            else {
                if(mid==e) return e+1;
                s=mid+1;
            }
        }
    }