CS600 Algorithms and Data Structures

CS600 Algorithms and Data Structures -- Lecture 4


Last update September 4, 2003





Topics References
1. Master Method Master Method: Textbook 4.3
2. T(n) = 4T(n/2) + n2 lg n Iteration Method
    (Master Theorem does not apply for this case.)
3. Outline of Proof for Master Method Master Method: Textbook 4.4
4. Quicksort -- An example Textbook pp. 145 - 148







Back to Lectures Home Page
Back to CS600 Home Page
Back to Toida's Home Page