Course Textbook: We will provide lecture notes, which can be found consolidated here.

Supplemental Textbook: CLRS - Introduction to Algorithms, 3rd edition by Cormen, Leiserson, Rivest, and Stein. You can obtain a free copy via the Penn Libraries

Note: The lecture schedule is tentative and subject to change as the term progresses.

Date	Topic	Required Readings
Thu, Jan 16, 2025	Welcome to CIS 1210	CIS 1210 Course Policies Course Resources Exam Dates & Policies [Optional] Ch 1: Review of Terms, Proofs, and Probability Ch 2: Gale-Shapley Stable Matching
Tue, Jan 21, 2025	Greatest Common Divisor, Insertion Sort, and Running time	Ch 3: Greatest Common Divisor Ch 4: Insertion Sort Ch 5: Running Time and Growth Functions
Thu, Jan 23, 2025	Asymptotic Notation and Running time	Ch 5: Running Time and Growth Functions Ch 6: Analyzing Runtime of Code Snippets
Tue, Jan 28, 2025	Running Time of Code Snippets, Divide and Conquer	Ch 6: Analyzing Runtime of Code Snippets Ch 7: Divide & Conquer and Recurrence Relations
Thu, Jan 30, 2025	Binary Search, Insertion Sort, Merge Sort, Counting Inversions	Ch 7: Divide & Conquer and Recurrence Relations Ch 9: Counting Inversions