Education For All

www.edforall.net

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

Programming Abstractions - Lecture 16

Get the Flash Player to view video.
Lecture 16 - Quicksort

Partitioning for Quicksort, Quicksort Code Working/execution, Quicksort Code, Live Demo: Running Quicksort vs Merge Sort, Bad Split Example, Worst Case Split, What Input has Worst Case for Quick Sort, Live Demo: Running Quicksort vs Merge Sort, Different Input Scenarios, Strategy to Avoid Worst Case Split, Execution Time Tabulation, Towards Generic Functions: Swap, Function Template, Example Live Code, Template Instantiation and its Errors, Sort Template, Client Use of Sort Template

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.)

Supplementary lecture material is listed below.

1. Assignment 5
2. Solutions for Assignment 5
3. Programming Assignment 5 - Sorting
4. Starter code for Programming Assignment 5



 

Translate

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