Book of Red Gate 2010 - Red Gate Software

2. Give a test case that shows this code is broken.
static int BinarySearch(IList items, int
target)
{
int lower = 0;
int upper = items.Count;
while (lower != upper - 1)
{
int mid = (lower + upper)/2;
if (target < items[mid])
upper = mid;
else
lower = mid;
}
if (items[lower] == target)
return lower;
return -1;
}
3. This always throws an exception, right?
A foo = null;
foo.Bar();
Continued over the page...
102