anonymous
  • anonymous
Can someone explain to me 'bisection search' ?
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 :)
SOLVED
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.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
osanseviero
  • osanseviero
Ok, let's think we have to find a value in the range 1 to 1 million
osanseviero
  • osanseviero
I am going to try that you answer yourself
osanseviero
  • osanseviero
So...how would you try to find this value?

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

osanseviero
  • osanseviero
toc toc?
anonymous
  • anonymous
i know its where you guess half way and then see if the answer is lower or higher. I'm just now super clear on how to set it up in python
anonymous
  • anonymous
not*
osanseviero
  • osanseviero
You should write a psudo code first x is the value you are searching a is the max range b is the min range c is (a+b)/2 -> midpoint if x>c: the min range will be c now. else: the max range will be c now Something like that :) try working around it
anonymous
  • anonymous
Don't forget an epsilon value, or you may end up in an infinite loop.
UnkleRhaukus
  • UnkleRhaukus
sounds like binary search
anonymous
  • anonymous
Are you referring specifically to Newton's method? Because that actually has a rather complicated proof to explain why it converges on the square root. For just how to implement it in Python, review the code from Prof. Guttag's examples: http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-00sc-introduction-to-computer-science-and-programming-spring-2011/unit-1/lecture-3-problem-solving/MIT6_00SCS11_lec03.pdf
lopus
  • lopus
this video can help you: https://www.youtube.com/watch?v=nJ74bEB-UEw

Looking for something else?

Not the answer you are looking for? Search for more explanations.