Question

Can someone explain to me 'bisection search' ?

Answer 1

Ok, let's think we have to find a value in the range 1 to 1 million

Answer 2

I am going to try that you answer yourself

Answer 3

So...how would you try to find this value?

Answer 4

toc toc?

Answer 5

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

Answer 6

not*

Answer 7

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

Answer 8

Don't forget an epsilon value, or you may end up in an infinite loop.

Answer 9

sounds like binary search

Answer 10

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

Answer 11

this video can help you: https://www.youtube.com/watch?v=nJ74bEB-UEw