Recitation 4: Recursion, Pseudo code and Debugging
author: Mitchell A. Peabody,
Massachusetts Institute of Technology, MIT
recorded by: Massachusetts Institute of Technology, MIT
published: Oct. 29, 2012, recorded: February 2011, views: 2509
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
recorded by: Massachusetts Institute of Technology, MIT
published: Oct. 29, 2012, recorded: February 2011, views: 2509
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Related content
Report a problem or upload files
If 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.
Description
Topics covered: Recursion, divide and conquer, base cases, iterative vs. recursive algorithms, Fibonacci numbers example, recursive bisection search, optional and default parameters, pseudo code, introduction to debugging, test cases and edge cases, and floating points.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: