Hacker News Reader

Would this benefit from the galloping optimization Tim Peter's was talking about on Hn recently?

If one side is bigger than the other, try to find how many elements you can add from that side and advance that far.

Certainly, but the effectiveness is data dependent. It would work well for example if the two ranges have little overlap.

I'm sure the answer is you need to check, but would the cost of checking if you can gallop hurt performance in other cases.

I'm wondering if this removing the branch idea and the galloping idea can coexist.