bool BinSearch(const int* array, const int size,const int value)
{
if (NULL == array ||
0 >= size) {
return false;
}
int low = 0;
int high = size - 1;
int middle = 0;
while(low <= high)
{
middle = (low + high)/2;
if (array[middle] == value) {
return true;
} else if (array[middle] > value) {
high = middle - 1;
} else if (array[middle] < value) {
low = middle + 1;
}
}
return false;
}