// the find
liuyubobobo/Play-with-Algorithms
Codes of my MOOC Course <Play with Algorithms>, Both in C++ and Java language. Updated contents and practices are also included. 我在慕课网上的课程《算法与数据结构》示例代码，包括C++和Java版本。课程的更多更新内容及辅助练习也将逐步添加进这个代码仓。
Companion code repository for a Chinese-language MOOC course on algorithms and data structures, covering sorting, heaps, BSTs, union-find, graph algorithms, and shortest paths in both C++ and Java. It's a teaching aid, not a library — every folder is a standalone snapshot of one lecture's code. Useful if you're following the imooc course or want clean, minimal reference implementations of textbook algorithms.
The code is organized lecture-by-lecture with incremental snapshots, so you can see exactly how an algorithm evolves from naive to optimized across consecutive sections. Both C++ and Java versions are kept in sync, which is rare for course repos and useful for language comparison. The quicksort coverage is genuinely thorough: basic, randomized, two-way, and three-way partitioning are all separate, runnable examples rather than one monolithic file with ifdef branches. Optional supplement sections go beyond the course material — Morris traversal, lower/upper bound binary search, SPFA — though many are marked 'coming soon' and never arrived.
Last commit was December 2021 and dozens of supplement entries are still 'coming soon' after years — this repo is effectively abandoned. There are no build scripts or project files unifying the Java code; each lecture subfolder has its own source tree with no Maven/Gradle setup, so you can't just clone and build anything. The C++ side uses CMakeLists.txt per folder, which works but fragments the codebase into hundreds of tiny single-file projects. No tests anywhere — the 'testing' approach is hardcoded main() calls with console output, which makes it hard to verify correctness when adapting code.