L2：01 - Binary Search

http://lintcode.com/en/problem/binary-search/

Binary search is a famous question in algorithm. For a given sorted array (ascending order) and a target number, find the first index of this number in O(log n) time complexity. If the target number does not exist in the array, return -1. Example If the array is [1, 2, 3, 3, 4, 5, 10], for given target 3, return 2.

/**
 * Copyright: NineChapter
 * - Algorithm Course, Mock Interview, Interview Questions
 * - More details on: http://www.ninechapter.com/
 */

#include <vector>
using namespace std;

class Solution {
public:
    int binarySearch(vector<int> &A, int target) {
        if (A.size() == 0) {
            return -1;
        }

        int start = 0;
        int end = A.size() - 1;
        int mid;

        while (start + 1 < end) {<span style="white-space:pre">	</span>//注意
            mid = start + (end - start) / 2;<span style="white-space:pre">	</span>//注意
            if (A[mid] == target) {
                end = mid;
            } else if (A[mid] < target) {
                start = mid;
            } else if (A[mid] > target) {
                end = mid;
            }
        }

        if (A[start] == target) {
            return start;
        }
        if (A[end] == target) {
            return end;
        }

        return -1;
    }
};

以上为模板code
【注意】实现的关键：

1. start + 1 < end//通常写的是 start < end 会出现死循环，比如start = 1, end = 2。 所以其他类似题把这里固定为这个写法。
2. start + (end - start) / 2 //防止两个32位最大整数相加溢出。
3. A[mid] ==, <, >
4. A[start] A[end] ? target