indy256/codelibrary resource
:gem:Collection of algorithms and data structures observed · 2026-08-28
Health v2 · maintenance only
73/100
- Activity 91
- Release rhythm 35
- Longevity 100
Flags: no_releases
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-03. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 5648
- days_rel: n/a
- days_push: 59
- n_releases_24m: 0
Adoption not part of the score
2028 stars · 520 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
A curated collection of algorithm and data structure implementations in C++, Java, Kotlin, Python, and Rust. It serves as a reference code library for competitive programming and algorithm study.
Use cases
- find reference implementations of segment trees and Fenwick trees
- study competitive programming algorithms in Java and C++
- copy well-tested data structure code for contests
- learn how link/cut trees and treaps work
- compare algorithm implementations across multiple languages
When to choose
- you need battle-tested implementations of classic data structures for competitive programming
- you want to study algorithm implementations in several languages side by side
When to avoid
- you need a production-ready algorithm library with package management and stable APIs
- you want high-level abstractions rather than standalone reference code
Facets
learning-resource · maturity active
developer-tools education programming-languages cpp jvm python rust competitive-programming data-structures algorithms reference-implementation code-library
1 source
- readme: https://github.com/indy256/codelibrary · fetched 2026-08-28 · 63b01d6ba0a1
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| indy256/codelibrary | main | 73 |
For agents
markdown · JSON · MCP: product_card(name="indy256/codelibrary")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem