manning/mergealgorithms — explained in plain English
Analysis updated 2026-07-17 · repo last pushed 2017-04-06
Practice implementing AND/OR merge operations over sorted document ID lists.
Learn how phrase search (words appearing near each other) is implemented efficiently.
Study how small search systems avoid keeping all data in memory.
Build a toy search engine for a university course or self-study.
| manning/mergealgorithms | autismdevelopment/autism-client | normanmaurer/netty | |
|---|---|---|---|
| Stars | 22 | 22 | 22 |
| Language | Java | Java | Java |
| Last pushed | 2017-04-06 | — | 2021-10-18 |
| Maintenance | Dormant | — | Dormant |
| Setup difficulty | easy | hard | moderate |
| Complexity | 3/5 | 3/5 | 4/5 |
| Audience | researcher | general | developer |
Figures from each repo's GitHub metadata at analysis time.
Exercise-based coursework rather than a runnable application, no external infra needed.
A set of programming exercises that teach the merge-based algorithms search engines use to quickly find documents matching multiple search words.
Mainly Java. The stack also includes Java.
Dormant — no commits in 2+ years (last push 2017-04-06).
Setup difficulty is rated easy, with roughly 30min to a first successful run.
Mainly researcher.
This repo across BitVibe Labs
Verify against the repo before relying on details.