AmortizedAlgorithmAnalysis

# AmortizedAlgorithmAnalysis - Amortized Algorithm Analysis...

This preview shows pages 1–7. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Amortized Algorithm Analysis COP3503 July 25, 2007 Andy Schwartz Contents • Indirect Solutions • Amortized Analysis Introduction • Extendable Array Example • Binomial Queue • Binomial Queue Example Indirect Solution (Source: Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. 10 yards / minute 100 yards / minute Indirect Solution (Source: Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. 10 yards / minute 100 yards / minute Geometric Series? The easy solution is indirect. It takes a kitten 5 minutes to go 50 yards, how far can the mother go in 5 minutes?.... 500 yards! Amortized Analysis Introduction • The worst-case running time is not always the same as the worst possible average running time. • Example: – Worst case-time is O(n) – Amortized worst-case is O(1) – This could be from a series of table inserts and clears (Source: Arup Guha. CS2 Notes – Summer 2007. Amortization Techniques • Two Techniques: – Potential Function – Accounting Method • Start with \$X dollars for n operations....
View Full Document

## This document was uploaded on 11/09/2009.

### Page1 / 16

AmortizedAlgorithmAnalysis - Amortized Algorithm Analysis...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online