Binary search and so forth(二)
g(N) where N is the distance
// between the initial point and the end of the chunk
return FindRightmostMatch(list, lastIndex, index, item, comparer);
}
The binary search subroutine has been reasonably tested. The other two haven't undergone proper test thereby may subject to revision.