Slides in Powerpoint format:

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