Slides, pictures

Pictures

Friday 8/31/18: Lower bound for sorting slides,

Wednesday 9/5/18: BST and Heap slides,
build_heap build_heap runtime build_heap runtime 2 build_heap runtime 3

Monday 9/10/18: Divide-and-conquer slides,

Monday 9/24/18: Quicksort slides,

Wednesday 9/26/18: Order statistics slides,

Friday 9/28/18: Dynamic programming slides; notes for Hirschberg's algorithm by Rolf Fagerberg, java code by Shun Cheung

Monday 10/1/18: Matrix chain multiplication slides

Monday 10/8/18: Knapsack slides, knapsack notes 1, knapsack notes 2, knapsack notes 3,

Wednesday 10/10/18: Amortization slides,

Monday 10/15/18: Graph slides,

Wednesday 10/17/18: Union/Find slides,

Monday 10/22/18: MST notes by Jeff Erickson, including Boruvka's algorithm, Fibonacci heap slides slides by Kevin Wayne,

Friday 10/26/18: Shortest paths slides,

Wednesday 10/31/18: Network flow slides,

Friday 11/2/18: Test 2 review,

Wednesday 11/7/18: Max flow applications slides by Kevin Wayne [slides 1-10 and 15 about bipartite matching]

Monday 11/12/18: Randomized Algorithms slides by Kevin Wayne [slides 8-16 about randomized min-cut]; Randomized Min-Cut notes by Jeff Erickson

Wednesday 11/14/18: High-probability runtime bound for quicksort (pages 38-43)

Friday 11/16/18: P and NP slides

Friday 12/7/18: Final review

Last modified by Carola Wenk, cwenk -at- tulane -dot- edu,