I am following the material for MIT 6.00 Spring 2011 currently working on Problem Set 1 part c.... This is about Credit Card debt. I did a search on google and other people were working on PS1 but it was about Prime Numbers... Am I on the right material?
Does any one want to work together on these PSs? I've hit a wall with the bisection search. I thought I understood it but I am unable to apply it to to the credit solution.
MIT 6.00 Intro Computer Science (OCW)
Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
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.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
The code from the class that goes over the bisection search is pretty close to what you need to use. If you break that code apart piece by piece and reapply it to your search you should be able to get it to work.
There is also a MIT 6.00 from 2008, that had prime numbers for PS1.
What don't you understand about the bisection search?
Not the answer you are looking for? Search for more explanations.
Patrick, My really short answer is: Pick average of HI and LOW as GUESS. If GUESS is too low replace LOW by GUESS. If GUESS is too high replace HI by GUESS. Repeat until converged within error limit. Did that help?