finds.dev

qiwsir/algorithm

View on GitHub

★ 3,299Pythonupdated Jun 2022

// the take

A collection of algorithm implementations in Python, written by a Chinese developer as a learning resource. Each algorithm gets a markdown explanation file paired with a .py source file. Aimed squarely at beginners learning algorithms through Python.

The paired md+py structure is genuinely useful — you read the explanation, then look at the code, without hunting around. Covers a reasonable spread of classical topics: sorting variants, tree traversal, Dijkstra, Kruskal/Prim, dynamic programming coin change. The Fibonacci entry in particular often shows multiple implementations side by side, which is a good teaching pattern.

Dead since June 2022 and shows it — no tests, no type hints, no packaging, just flat files in a root directory. Content is in Chinese with no English translation, so the explanations are inaccessible to most of the repo's potential audience. Coverage is shallow and uneven: graph algorithms appear but there's nothing on hash tables, tries, or any DP beyond coin change. With 1040 forks it's clearly used as a homework-copying source more than a reference, which says something about the depth.

We read the README, the directory tree and a key source file in July 2026. Nobody pays to be listed. How we judge →

// at a glance

Stars
3,299
Forks
1,040
Language
Python
Last commit
8 Jun 2022

// nearby

If algorithm isn't quite it.

All repos →