CSE 589 Applied Algorithms Spring 1999
An Easy NP-Complete Problem
Subset Sum Algorithm
Example of the Algorithm
Polynomial or Exponential?
Strong NP-Completeness
Some “Hard” Problems are Easy
Evaluating Algorithms - Correctness
Examples of Quality Criteria
Theoretical Analysis
Empirical Evaluation
Atom
Atom Flow
Sorting
Classic Mergesort
Merging (1)
Merging (2)
Merging (3)
Recursive Mergesort
Mergesort Analysis
Solving the Recurrence
Merging Pattern of Recursive Mergesort
Email: ladner@cs.washington.edu
Home Page: http://www.cs.washington.edu/education/courses/589/CurrentQtr/
Other information: CSE 589: Applied Algorithms
Download presentation source