I'm trying to complete the third problem on Problem set one however I don't understand bisection search. Does it always need to have a epsilon? Also I finally looked at the solution after a few hours of trying and it does not work either, is it impossible?
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.
typically the problemsets have you use 'epsilon' when working with floating point numbers - when comparing numbers that are the result of floating point calcs there are inherent errors that need to be accounted for - those calcs might not produce a value that you expect and so may not compare the way you want them to. you need to set a tolerance.
bisection is an algorithim that reduces the problem (or search space) by 1/2 on each iteration. did you watch the lecture and read the readings and try out the examples from the lectures? what exactly don't you 'get'?
Thanks, I did read the readings and watch the lectures. I apparently was not understanding the need for an epsilon, the moment I added one in the code works fine. I guess I hit a silly level of frustration and didn't think about inherent errors.
using the Decimal clss from the decimal module you can see the actual values