Education For All

www.edforall.net

Text size
  • Increase font size
  • Default font size
  • Decrease font size

Programming Abstractions - Lecture 14

Get the Flash Player to view video.
Lecture 14 - Algorithm Analysis

Algorithm Analysis, Evaluating the Performance, Analysis of Codes: Statement Counts, Another Example (Statement Count Contd.), Comparing Algorithm, Big-O Notation, Big-O to Predict the Time of Execution, Best/Worst/Average Case, Analysis of Recursive Algorithms, Another Example : Towers of Hanoi, A Tabulation for Different Algorithms, Growth Patterns, Application of Algorithm Analysis to Sorting, Selection Sort, Selection Sort Code

Julie Zelenski
CS106B Programming Abstractions
(Stanford University: Stanford Engineering Everywhere)
http://see.stanford.edu
Date accessed: 2008-12-04
License: Creative Commons Attribution 3.0

Lecture Material

To view the lecture material accompanying this lecture in a new window, please click the button below. If necessary, use the vertical or horizontal scrollbar in the new window to view more of the material or you can resize the window.

To download the above lecture material use this link. (Right-click and select Save Target As or Save Link As.)



 

Translate

Chinese (Simplified) French German Italian Japanese Korean Portuguese Russian Spanish
More educational resources: