Sections of text
Introduction                       Chapters 1, 2
Problems, instances, size of an instance
Elementary operations, benchmarks
Growth of functions,asymptotic notation 3.1
Average-case, worst-case, best-case 
InsertionSort
SelectionSort
Heaps                              Chapter 6
QuickSort                          Chapter 7
Selection                          Section 9.2
Minimum Spanning Tree              Chapter 23
Data Structures for Disjoint Sets  Chapter 21
Shortest Path                      Chapter 24
Dynamic Programming                Chapter 15
Search in Graphs                   Chapter 22
Probabilistic Algorthms