Lecture 8: Efficiency and Order of Growth
author: John Guttag,
Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, MIT
recorded by: Massachusetts Institute of Technology, MIT
published: Oct. 29, 2012, recorded: February 2011, views: 2430
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: 2430
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
This lecture revolves around the topic of algorithmic efficiency. It introduces the random access model (RAM) of computation and "big O notation" as a way to talk about order of growth. It concludes with binary search.
Topics covered: Efficiency, problem reduction, RAM, best case, worst case, expected case, growth, exponential growth, polynomial growth, logarithmic growth, global variables.
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: