Search Insert Position

/*
简单二分
*/
class Solution {
public:
    int searchInsert(int A[], int n, int target) {
        int l = 0,r = n-1,mid ;
        while(l<=r){
            mid = l+(r-l)/2;
            if(A[mid] == target) return mid;
            else if(A[mid]>target) r = mid-1;
            else l = mid+1;
        }
        return l;
    }
};