Lecture 3: Problem solving. When professor Guttag talked about bisection search at about 41 minutes. He said the number of guesses of the square root of 12345 is 26. And then he said something about the size of the search space, which is roughly 12345 divided 0.01 square. and the answer is 26.89.... Can someone explain this formula to me? because I can't get the answer. Is it 12345/(0.01**2) or (12345/0.01)**2?
MIT 6.00 Intro Computer Science (OCW)
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
The formula is not the important point, rather the concept that bisection search can make programs much faster is. :)
the maximum (and probably approximate) number of guesses is log base 2 of the search field which makes sense intuitively if you think about what log2 is:-)
The value obtained by teacher results from log base 2 of (12345 / (0.01 ** 2))
aa = ( 12345 / (0.01 ** 2) )
bb = math.log(aa,2)