Lecture 3: Problem Solving
recorded by: Massachusetts Institute of Technology, MIT
published: Oct. 29, 2012, recorded: January 2011, views: 2535
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
This lecture covers the use of iteration to build programs whose execution time depends upon the size of inputs. It also introduces search problems and brute force and bisection for solving them.
Topics covered: Termination, decrementing functions, exhaustive enumeration, brute force, while loop, for loop, approximation, specifications, bisection search.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !