CSE 326: Data StructuresLecture #24The Algorhythmics
Today’s Outline
Greedy Algorithms
Hill-Climbing
Greed in Action
Scheduling Problem
Greedy Solution
Proof of Correctness
Divide & Conquer
Divide & Conquer in Action
Closest Points Problem
Closest Points Algorithm
Closest Points Algorithm Refined
Memoizing/Dynamic Programming
Dynamic Programming in Action
Fibonacci Numbers
Optimal Binary Search Tree Problem
The Optimal BST
Optimal BST Cost
Optimal BST Algorithm
To Do
Coming Up
Email: owner-cse326@cs.washington.edu
Home Page: http://www.cs.washington.edu/326/
Download presentation source