Binary search occurrences recursive impls index out of bounds

[domfarolino]

The recursive binary search "first occurrence" and "last occurrence" variations index out of bounds given an empty array, producing undefined (usually fine though) behavior. This should be fixed. Perhaps in these binary search variants, since we will always come out of the while loop before returning, we should perform size == 0 checks early on?