Lec 6 | MIT 6.00 Introduction to Computer Science and Programming, Fall 2008

Lecture 6: Bisection methods, Newton/Raphson, introduction to lists

Instructors: Prof. Eric Grimson, Prof. John Guttag

View the complete course at: http://ocw.mit.edu/6-00F08

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Category:

Education

Tags:

• computer
• programming
• Python
• science
• computation
• problem
• solving
• recursion
• binary
• search
• classes
• inheritance
• libraries
• algorithms
• optimization
• problems
• modules
• simulation
• big-O-notation
• control
• flow
• exceptions
• building
• computational
• models
• software
• engineering

[32koala]

Python

[RobCozzens]

The 'incorrect' square root wasn't a precision error, it was a typo. The program printed out that it taking the square root of 123456789 for both of them, but it was actually taking the square root of 1234567890 for the first one.

[brassmonkey9871]

well it apears asthough youtube thinks im trying to hack so i cant post the code

[brassmonkey9871]

@MIT i am using 2.7.2 and (as far as i can tell) i copied this exact equation but if i typed in sqrtbi(9, 0.0001) my result was 2.25, then i typed in sqrtbi(25, 0.0001) my result 6.25... can some one examine my copied program and tell me what mistake i have maid?

[iateyourgranny]

Correction: the babylonians devised the method ascribed here to Newton-Rhapson, although it was only for the particular case of finding square-roots

[scorpionismification]

@prithudak1 thank you for trying to explain although honestly I didn't quite understand the use of n. However, as you recommended, Wikipedia did help me solve it! so thanks again :)

[prithudak1]

Using Newtonian equation

a slope of tangent can be shown as dy/dx

dy is equal to f[x(n] - 0

dx can be represent as [x(n+1) - x(n)]

now use the algebra to get the value of x(n+1)

for more explanation search newton's tangent method in Wikipedia

[scorpionismification]

Does any one know how we get guessi+1 = (guessi-F(guessi))/2*guessi ? Thanks

[agapitoflores001]

I'll be a genius in programming after I finish watching his lectures.

[LarsYurich]

Thumbs up for the Macbook bashing at 26:10.

[someonep93]

@a00225186 It's a class designed for total beginners at programming, it gets more interesting when you get to more advanced topics.

[ILOVEANIMEHOPECARD]

dunno. cuz u want candy?