result = false;
}
}
// test no find
if(BSearch(t,NUM,t[0] - 1) != -1 || BSearch(t,NUM,t[NUM-1] + 1) != -1){
result = false;
}
return result;
}
/**
* Test function
*/
bool TestBetterBSearch(){
const int NUM = 20;
int BeginNum = 10;
int t[NUM];
for(int i = 0; i< NUM; ++i){
t[i] = BeginNum;
++BeginNum;
}
bool result = true;
for(int j = 0 ;j < NUM; ++j){
if(BetterBSearch(t, NUM , t[j]) != j){
result = false;
}
}
// test no find
if(BetterBSearch(t,NUM,t[0] - 1) != -1 || BetterBSearch(t,NUM,t[NUM-1] + 1) != -1){
result = false;
}
return result;
}
int main(int argc, char* argv[])
{
const int NUM = 10;
int t[NUM] = {10,11,12,13,14,15,16,17,18,20};
PrintfNum(t,NUM);
for(int i = 0 ;i < NUM; ++i){
cout << t[i] << " was at index: " << BSearch(t, NUM , t[i]) << endl;
}
cout << "searching 100 in array t, result: "<< BSearch(t, NUM , 100) << endl;
cout << endl;
cout << "BSearch test result:" << TestBSearch() << endl;
cout << "BetterBSearch test result:" << TestBetterBSearch() << endl;
return 0;
}
template
void PrintfNum(T a[],const int& n){
for(int i = 0; i < n; ++i){
cout << a[i] << ",";
}
cout << endl;
}
