Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Analysis of Algorithms Max Alekseyev
 

Summary: 1/29
Analysis of Algorithms
Lecture 20
Max Alekseyev
University of South Carolina
November 18, 2010
2/29
Outline
Amortized analysis
Aggregate analysis
Stack with multipop operation
Binary Counter
Accounting method
Potential method
Dynamic tables
3/29
Amortized analysis
Analyze a sequence of operations on a data structure.
Goal: Show that although some individual operations may be
expensive, on average the cost per operation is small.

  

Source: Alekseyev, Max - Department of Computer Science and Engineering, University of South Carolina

 

Collections: Biotechnology; Computer Technologies and Information Sciences