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 http://leetcode.com/onlinejudge#question_35

leetcode_search_insert_position.cpp

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
        int ans = n;
        int left = 0, right = n - 1;
        while (left <= right) {
            int mid = (left + right) >> 1;
            if (A[mid] >= target) {
                ans = min(ans, mid);
                right = mid - 1;
            }
            else
                left = mid + 1;
        }
        return ans;
    }
};