int binSearch(int *nums, int size, int num)
{
int hight = size;
int lower = 0;
int mid = 0;
while(lower < hight)
{
mid = (hight + lower) / 2;
if(num > nums[mid])
{
lower = mid + 1;
}
else if(num < nums[mid])
{
hight = mid - 1;
}
else
{
return mid;
}
}
return -1;
}