默认:从小到大排好序的基本类型数组;
升级:自定义排序规则排好序的、元素为T类型的数组(NOTE:查找时的排序规则与排序时的规则一致);
NOTE:
在区间内找到“等于”该元素的值,返回true;
“等于”的含义:a等于b<=>“a必须在b前面”,“b必须在a前面”都不成立。
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
struct Rule2{
bool operator()(const int &a1, const int &a2){
return a1 % 10 < a2 % 10;
}
};
void Print(int a[], int size){
for (int i = 0; i < size; i++)
cout << a[i] << " ";
cout << endl;
}
int main(){
int a[] = { 12, 45, 3, 98, 21, 7 };
int num = sizeof(a) / sizeof(int);
sort(a, a + num, Rule2());
Print(a, num);
cout << "result: " << binary_search(a, a + num, 7) << endl;
//排序规则与查找规则不一致,无意义
cout << "result: " << binary_search(a, a + num, 8, Rule2()) << endl;
//按个位数排序,则查找时只看个位数
cin.get();
return 0;
}