Ask your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW) 18 Online
OpenStudy (anonymous):

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.

OpenStudy (anonymous):

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.

OpenStudy (rsmith6559):

There is also a MIT 6.00 from 2008, that had prime numbers for PS1.

OpenStudy (anonymous):

What don't you understand about the bisection search?

OpenStudy (anonymous):

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?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!