// the find
algorithmzuo/algorithmbasic2020
算法和数据结构体系学习班
A Chinese-language algorithm and data structures course taught as a paid class, with the Java source code made public on GitHub. Covers the full sweep from basic sorting through advanced topics like suffix arrays, Dinic's max-flow, and bitset DP. Aimed at developers preparing for technical interviews or filling gaps in CS fundamentals.
The topic progression is unusually complete — 47 classes moving from selection sort all the way to DC3 suffix array construction and network flow, which most similar repos don't reach. Each class stays small and focused: one file per problem, no sprawling utility frameworks to untangle. The more interesting entries (Morris traversal, size-balanced trees, Aho-Corasick, reservoir sampling) are topics that are genuinely hard to find clean standalone implementations of. File naming is systematic enough that you can grep for a topic and land in the right place immediately.
Everything is in Chinese, and not just the README — the course context lives outside this repo entirely, so without the accompanying video lectures the code is largely uncommented and context-free. Last commit was June 2023, so anything added to competitive programming canon since then is missing. No tests anywhere: the implementations are presumably verified against OJ judges, but there's nothing runnable locally to confirm correctness after any modification. The graph representation in class16 (custom Node/Edge/Graph classes) is idiosyncratic and won't transfer to real projects without rewriting.