简单的二分查找条件

二分查找的三种条件判断，以及试用的场景

大家都知道二分查找的原理，将搜索的区域分两半，当然只对已经排序了的起作用，这里说的是迭代的方式

1. end = mid - 1;

   start = mid + 1;

	在这种情况下，start 和 end 之间始终是所搜范围，则搜索空间范围是 [start, end]，这两句的意思就已经指出 start 和 end 在搜索范围内

	且推断 start、mid、end 取值的并区间为 [start-1, end+1]，

		取极端情况 start == end 时，当 查找的 s<middle 时 end = start -1 == -1，当 s>middle 时 start = end +1 == 1 

	则给出条件 start <= end 或 mid != start && mid != end

#include <iostream>
using namespace std;

int main()
{
    int a[] {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    int s = 7;
    int start = 0, end = 9; 
    int middle = start + (end - start)/2;
    
    while( start <= end && a[middle] != s )
    {
        if( s < a[middle] )
            end = middle;
        else 
            start = middle;
        middle = start + (end - start)/2;
    }
    
    if( start > end )
        cout << "not found" << endl;
    else 
        cout << "has found: NO." << middle << endl;
    return 0;
}

2. end = mid;

   start = mid + 1;

	同上，搜索空间为 [start, end)，这两句的意思就已经指出 end 不在搜索范围内

	start、middle、end 取值的并区间为 [start, end+1]

	给出条件 mid != end

#include <iostream>
#include <vector>
using namespace std;

int main()
{
    vector<int> a;
    for( int i = 0; i != 10; ++i )
        a.push_back(i+1);
        // initialized as 
        // int a[] {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    vector<int>::iterator start = a.begin(), end = a.end();
    vector<int>::iterator middle = a.begin() + a.size()/2;
    int s = 7;
    
    while( middle != end && *middle != s )
    {
        if( s < *middle )
            end = middle;
        else 
            start = middle + 1;
        middle = start + (end - start)/2;
    }
    
    if( middle == end )
        cout << "not found" << endl;
    else 
        cout << "has found: NO." << middle-a.begin() << endl;
    return 0;
}

3. end = mid;
   start = mid;
	这种赋值时，大多数情况下没问题，但在极端情况下就会陷入死循环
	当 end == start 时，且唯一的一个元素不等于所查找的 s
#include <iostream>
using namespace std;

int main()
{
	int a[]{ 1 };
	//int a[]{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
	int s = 7;
	int start = 0, end = 0;
	int middle = start + (end - start) / 2;

	while (start <= end && a[middle] != s)
	{
		if (s < a[middle])
			end = middle;
		else
			start = middle;
		middle = start + (end - start) / 2;
	}

	if (start > end)
		cout << "not found" << endl;
	else
		cout << "has found: NO." << middle << endl;
	return 0;
}


综上，建议 使用 middle = start + (end - start)/2 的方式取平均值
当 end 所指向的元素在搜索范围里时：
	end = mid - 1;
	start = mid + 1;
	条件：start <= end
当 end 所指向的元素不在搜索范围里时：
	end = mid;
	start = mid + 1;
	条件：mid != end