LeetCode：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

// Source : https://oj.leetcode.com/problems/search-insert-position/
// Author : Chao Zeng
// Date   : 2014-12-19
// 注意分类讨论个各种情况
class Solution {
public:
	int searchInsert(int A[], int n, int targe) {
		int index = 0;
		for (int i = 0; i < n; i++){
			if (targe < A[0]){
				index = 0;
				return index;
			}

			if (targe > A[n-1]){
				index = n;
				return index;
			}

			if (targe <= A[i]){
				index = i;
				return index;
			}
		}
	}
};