二分查找 binary_search() 应用解析(详细)

binary_search() 判断target是否存在

binary_search() 在排序（正序）中，返回是否找到目标值（true or false）

定义和实现

template <class ForwardIterator, class T>
bool binary_search (ForwardIterator first, ForwardIterator last, const T& val);

template <class ForwardIterator, class T, class Compare>
bool binary_search (ForwardIterator first, ForwardIterator last, const T& val, Compare comp);

template <class ForwardIterator, class T>
  bool binary_search (ForwardIterator first, ForwardIterator last, const T& val)
{
	//Return iterator to lower bound 
	// 返回第一大于等于目标值得迭代器
	first = std::lower_bound(first, last, val);  
	return (first != last && !(val < *first));
}

实例：

// binary_search example
#include <iostream>     // std::cout
#include <algorithm>    // std::binary_search, std::sort
#include <vector>       // std::vector

bool myfunction (int i,int j) { return (i<j); }
int main () {
  int myints[] = {1,2,3,4,5,4,3,2,1};
  std::vector<int> v(myints,myints+9);                         // 1 2 3 4 5 4 3 2 1

  // using default comparison:
  std::sort (v.begin(), v.end());
  std::cout << "looking for a 3... ";
  if (std::binary_search (v.begin(), v.end(), 3)) 
  	std::cout << "found!\n"; else std::cout << "not found.\n";

  // using myfunction as comp:
  std::sort (v.begin(), v.end(), myfunction);
  std::cout << "looking for a 6... ";
  if (std::binary_search (v.begin(), v.end(), 6, myfunction))
    std::cout << "found!\n"; else std::cout << "not found.\n";

  return 0;
}

Output:
looking for a 3... found!
looking for a 6... not found

lower_bound () 和 upper_bound() target存在一个区间[lower_bound, upper_bound]

lower_bound () 在排序（正序）中，返回第一大于等于目标值的迭代器（相邻目标之后）

定义和实现

template <class ForwardIterator, class T>
ForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val);

template <class ForwardIterator, class T, class Compare>
ForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val, Compare comp);

template <class ForwardIterator, class T>
  ForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val)
{
  ForwardIterator it;
  iterator_traits<ForwardIterator>::difference_type count, step;
  count = distance(first,last);
  while (count>0)
  {
    it = first; step=count/2; advance (it,step);
    if (*it<val) {                 // or: if (comp(*it,val)), for version (2)
      first=++it;
      count-=step+1;
    }
    else count=step;
  }
  return first;
}

upper_bound() 在排序（正序）中，返回最后一个小于等于目标值的迭代器（相邻目标之前）

定义和实现

template <class ForwardIterator, class T>
ForwardIterator upper_bound (ForwardIterator first, ForwardIterator last, const T& val);

template <class ForwardIterator, class T, class Compare>
ForwardIterator upper_bound (ForwardIterator first, ForwardIterator last, const T& val, Compare comp);

template <class ForwardIterator, class T>
  ForwardIterator upper_bound (ForwardIterator first, ForwardIterator last, const T& val)
{
  ForwardIterator it;
  iterator_traits<ForwardIterator>::difference_type count, step;
  count = std::distance(first,last);
  while (count>0)
  {
    it = first; step=count/2; std::advance (it,step);
    if (!(val<*it))                 // or: if (!comp(val,*it)), for version (2)
      { first=++it; count-=step+1;  }
    else count=step;
  }
  return first;
}

实例：

// lower_bound/upper_bound example
#include <iostream>     // std::cout
#include <algorithm>    // std::lower_bound, std::upper_bound, std::sort
#include <vector>       // std::vector

int main () {
  int myints[] = {10,20,30,30,20,10,10,20};
  std::vector<int> v(myints,myints+8);           // 10 20 30 30 20 10 10 20
  std::sort (v.begin(), v.end());                // 10 10 10 20 20 20 30 30

  std::vector<int>::iterator low,up;
  low=std::lower_bound (v.begin(), v.end(), 20); //          ^
  up= std::upper_bound (v.begin(), v.end(), 20); //                   ^

  std::cout << "lower_bound at position " << (low- v.begin()) << '\n';
  std::cout << "upper_bound at position " << (up - v.begin()) << '\n';

  return 0;
}

Output:
lower_bound at position 3
upper_bound at position 6

PS:

分析了 C++ STL 里的binary_search()二分查找函数 ，我们可以根据自己逻辑需求来使用。
如果需求只是要查询有序数组中是否有目标值 targe存在，那么我们就直接可以用

int target = 3;
if (std::binary_search (v.begin(), v.end(), target))
	std::cout << "found!\n"; else std::cout << "not found.\n";

如果逻辑需求中不仅有需要知道是否存在，而且需要知道存在的位置，我们就一个用

//第一个 20 存在位置
low = std::lower_bound (v.begin(), v.end(), 20); 
if (low != v.end() && !(20 < *low)) 
	std::cout << "found! lower_bound at position " << (low - v.begin()) << '\n'; else std::cout << "not found.\n";