Christian Couder <chriscool@xxxxxxxxxxxxx> writes: > Here is a table to help analyse what should be the best estimate for > the number of bisect steps left. > ... > So the algorithm used in this patch calculates 2^n and x, and then > choose between returning n - 1 and n. Two dumb questions about the math (because I suck at math). - Do you mean by "best estimate" the best case scenario, or something else (perhaps "the most accurate")? - Is computing based on linear history a good enough approximation? I am not advocating to make things more precise nor saying your math is flawed. I'd prefer simpler code for things like this --- after all, my understanding of this whole exercise is to give "this is more or less the number you should expect" ballpack figure and nothing more (correct me if that is not what you are aiming for). -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
