Bryn Mawr College
CS 340: Analysis of Algorithms
Spring 2025

General Information

This course will cover qualitative and quantitative analysis of algorithms and their corresponding data structures from a precise mathematical point of view. Topics include: performance bounds, asymptotic analysis, worst case behavior, proof of correctness and complexity. Particular classes of algorithms will be studied in detail, including greedy, divide-and-conquer, dynamic programming, networkflow, NPC and approximation algorithms.

Instructor: Dianna Xu , Park 203
E-Mail: dxu at cs dot brynmawr dot edu
WWW: http://cs.brynmawr.edu/~dxu

---

Assignments/Projects

---

Links

• Syllabus
• Algorithm write-up guidelines
• Proof Writing (Dr. Mark Tomforde)
• Mathematical Writing Resources
• Write-up Sample
• LaTeX template
• Brief Intro to LaTeX
• Not So Short Intro to LaTeX