On 18 February 2017 at 10:36, Alex Hoffman <spec@xxxxxx> wrote: > You definitely convinced me that git MUST search more than only in the > paths between good and bad commits, as the good commit G does not have > to be the first good commit (thank you for that). My problem/confusion > is that it returns something that does not make sense to me, because > it does not make sure it returns a transition. If multiple transitions from GOOD to BAD happen, then I don't see how binary search is useful/possible. The same is true for a simple list of numbers, say, 1 5 6 2 3 4. You can't use binary search here because you can't "throw away" all numbers to the left (or right) of your pivot. Or am I missing your point?