Lecture 6: Bisection Search (FIXED)

MIT 6.100L Introduction to CS and Programming using Python, Fall 2022
Instructor: Ana Bell
View the complete course: ocw.mit.edu/courses/6-100l-in...
KZbin Playlist: • MIT 6.100L Introductio...
This lecture discusses the simple algorithms of bisection search and Newton-Raphson. Bisection search takes advantage of the properties of the problem. Decomposition and abstraction make code easy to create, modify, maintain, and understand.
License: Creative Commons BY-NC-SA
More information at ocw.mit.edu/terms
More courses at ocw.mit.edu
Support OCW at ow.ly/a1If50zVRlQ
We encourage constructive comments and discussion on OCW’s KZbin and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at ocw.mit.edu/comments.

[@mitocw]

NOTE: The audio problems have been fixed!

[@luismariohonorestorres3086]

Thank you!

[@priyanshusharma751]

I teach Computer Science for Highschool (9-12). I always ask my student to go through these videos if they want to learn something different than the syllabus

[@Hsalz]

Omg this made so much sense! I loved this.

[@carsonjamesiv2512]

👍

[@akashguptame0397]

Is this course enough to get job

[@emir2750]

Probably no