1. INTRODUCTION, 2. GROWTH OF FUNCTIONS, 3. SUMMATION, 4. RECURRENCE, 5. HEAP AND HEAPSORT, 6. QUICK SORT, 7. SORTING IN LINEAR TIME, 8. MEDIANS AND ORDER OF STATISTICS, 9. ELEMENTARY DATA STRUCTURES, 10. HASHING, 11. BINARY SEARCH TREE, 12. RED-BLACK TREES, 13. SPLAY TREE, 14. AUGMENTING DATA STRUCTURES, 15. DYNAMIC PROGRAMMING, 16. GREEDY ALGORITHMS, 17. AMORTIZED ANALYSIS, 18. B-TREES: EXTERNAL SEARCHING, 19. BINOMIAL TREES AND BINOMIAL HEAPS, 20. FIBONACI HEAPS, 21. DATA STRUCTURES FOR DISJOINT SETS, 22. ELEMENTARY GRAPH ALGORITHMS, 23. MANIMUM SPANNING TREE, 24. SINGLE-SOURCE SHORTEST PATH, 25. ALL PAIRS SHORTEST PATHS, 26. MAXIMUM FLOW, 27. SORTING NETWORKS, 28. LINEAR PROGRAMMING, 29. NUMBER THEORITIC ALGORITHMS, 30. POLYNOMIALS AND FFT, 31. MATRIX OPERATIONS, 32. STRING MATCHING, 33. COMPUTATIONAL GEOMETRY, 34. NP-COMPLETENESS, 35. APPROXIMATION ALGORITHMS, 36. MISCELLANEOUS TOPICS