**CS 161 - Design and ****Analysis of Algorithms**
http://openclassroom.stanford.edu/MainFolder/CoursePage.php?course=IntroToAlgorithms

Course Description. Course Overview: Introduction to fundamental techniques for designing and analyzing algorithms, including asymptotic analysis; divide-and-conquer algorithms and recurrences; greedy algorithms; data structures; dynamic programming; graph algorithms; and randomized algorithms. Required textbook: Kleinberg and Tardos, **Algorithm** Design, 2005.

**DA:** 85 **PA:** 61 **MOZ Rank:** 13