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/31
Analysis of Algorithms
Lecture 17
Max Alekseyev
University of South Carolina
November 9, 2010
2/31
Outline
Augmenting data structures
Dynamic order statistics
Augmentation Methodology
Interval Trees
Dynamic Programming
Four-step Method
Rod Cutting Problem
3/31
Augmenting data structures
We shall be looking at methods for designing algorithms. In some
cases, the design will be intermixed with analysis. In other cases,
the analysis is easy, and it is the design that is harder.

  

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

 

Collections: Biotechnology; Computer Technologies and Information Sciences