Purpose

This collection keeps algorithm and data-structure notes that are useful for coursework, interview preparation, and long-term computer science foundations. Some material comes from Monash University FIT2004 and CLRS, but the notes should eventually stand on their own with definitions, examples, proofs, and implementation comments.

Current Reading Path

1. Algorithm Complexity

Planned Areas

• Asymptotic analysis and proof methods
• Sorting and selection
• Graph algorithms
• String algorithms
• Dynamic programming
• Data structures and amortized analysis

Status

Algorithm Complexity is the only complete bilingual note in this collection so far. New pages should be added in English and Chinese together.

Contributors: Yang Xingyu, Eryc123Y