Introduction

Welcome to the CS4820 notes section of the site.

These notes contain the major topics covered in Cornell's CS4820 (Introduction to Analysis of Algorithms):

• Stable Matching
• Greedy Algorithms
• Dynamic Programming
• Divide and Conquer
• NP-Completeness
• Network Flow
• Approximation Algorithms
• Computability

note

These notes reflect my personal experience taking and serving as a TA for CS 4820 at Cornell. They are not official course materials and may not cover all topics or reflect the current semester's curriculum.

Acknowledgements

These notes draw heavily from the course textbook Algorithm Design by Jon Kleinberg and Éva Tardos, as well as course notes from the Fall 2025 and Spring 2026 iterations of CS4820.