Slides in Powerpoint format:

• Introduction
• Getting Started
• Growth of Functions
• Recurrence
• More on Divide and Conquer
• Heapsort
• Quicksort
• Sorting in linear time
• Median Selection
• Hash Tables
• Bloom Filter
• Dynamic Programming
• Greedy Algorithms
• Amortized Analysis
• B-trees
• Fibonacci Heaps
• Disjoint Set Operations
• Elementary Graph algorithms
• Minimum Spanning Tree
• Single Source Shortest Path
• All Pairs Shortest Paths
• Maximum flow
• FFT