5 ms·
> there were close to 15,000 commits, which seemed like a large space to search by hand. Does the author not understand binary search? It would take about 14
by torrent-of-ions 12y ago
> there were close to 15,000 commits, which seemed like a large space to search by hand.
Does the author not understand binary search? It would take about 14 tries to find the failed commit.
- laichzeit0 12y agoI have no idea why people are downvoting you. Sigh. A comment as to why you're wrong by the downvoter(s) would be infinitely more helpful.
- erikb 12y agoBuilding 14 kernels and checking if they contain the bug manually sounds to be a lot of work for me. In that regard I think his post might not be a reasonable criticism. I think that criticism and being wrong is everybody's right, though. Therefore I wouldn't down vote a post for something like this but others seem to disagree.
- philh 12y agoI downvoted for tone, not because ve's wrong. I'm reasonably confident that someone who can write this blog post, understands binary search. I wouldn't have downvoted a post that simply said, for example: > Binary search over 15,000 commits would take about 14 tries to find the failed one. although I don't think that's an important point to be making. (As erikb said, that's still a lot of commits, and that was only the first run.)