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/17
Analysis of Algorithms
Lecture 5
Max Alekseyev
University of South Carolina
September 2, 2010
2/17
Outline
MergeSort Running Time
Recurrences
Substitution Method
Changing Variables
Tree Method
Master Method
3/17
Merge Runs in (n1 + n2)
Merge(A, p, q, r)
1. n1 = q - p + 1
2. n2 = r - q
3. Let L[1..n1 + 1 and R[1..n2 + 1] be two new arrays

  

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

 

Collections: Biotechnology; Computer Technologies and Information Sciences