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: Analysis of Algorithms
Lecture 3
Max Alekseyev
University of South Carolina
August 26, 2010
Outline
Bounding Sums
Integral Approximation
Differentiating and Integrating Series
Products
More Asymptotic Notation
Some More Math
Problems, Algorithms, and the RAM Model
Data Structures
Bounding Sums
We've already done a few of these. Here's one more: we show that
n
i=1 ik = (nk+1) for all fixed k 0.
For the upper bound, we have
n

  

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

 

Collections: Biotechnology; Computer Technologies and Information Sciences