AlgoIlluminated1

Algorithms Illuminated, Part 1: The Basics by Tim Roughgarden

Chapter 1: Introduction

• Introduction to Algorithm Analysis
• Problems

Chapter 2: Asymptotic Notation

• Standard Language for Discussing Rates of Growth in Algorithm Times
• Aysmptotic Notation
• Big-O Notation
• Two Basic Polynomial Examples
• Big-Omega and Big-Theta Notation
• Additional Examples
• Problems

Chapter 3: Divide and Conquer

• Divide and Conquer Paradigm
• Counting Inversions in O(n log n) Time
• Strassen's Matrix Multiplication Algorithm
• An O(n log n)-Time Algorithm for the Closest Pair
• Problems