CS600 Algorithms and Data Structures

CS600 Algorithms and Data Structures -- Lecture 2


Last update September 4, 2002





Topics References
1. Justification of Limit Test for Big-Oh etc.
2. Master Method Master Method: Textbook 4.3
3. T(n) = 4T(n/2) + n2 lg n Iteration Method
    (Master Theorem does not apply for this case.)
4. Quicksort -- Algorithm and an example Textbook pp. 145 - 148
5. Worst Case Time of Quicksort (to be continued) Textbook p. 155







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