ro31337/bigoposter resource
Big-O Complexities / Poster of common algorithms used in Computer Science observed · 2026-08-28
Health v2 · maintenance only
32/100
- Activity 0
- Release rhythm 35
- Longevity 100
Flags: no_releases no_license
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: 3712
- days_rel: n/a
- days_push: 1670
- n_releases_24m: 0
Adoption not part of the score
1660 stars · 135 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
A printer-friendly single-page poster summarizing Big-O time and space complexities of common computer science algorithms. It is a static reference resource rather than executable software.
Use cases
- print a big-o complexity poster for my desk
- quick reference for algorithm time complexities
- study cheat sheet for coding interviews
- find the complexity of common sorting and data structure operations
- classroom handout on algorithm complexity
When to choose
- you want a compact, printable one-page Big-O reference
- you need a visual study aid for interviews or coursework
When to avoid
- you need interactive complexity lookup or search
- you need executable code or algorithm implementations
Facets
learning-resource · maturity maintenance
documentation developer-tools education tutorials cross-platform big-o complexity cheatsheet poster algorithms reference computer-science
1 source
- readme: https://github.com/ro31337/bigoposter · fetched 2026-08-28 · 52efecc17fd8
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| ro31337/bigoposter | main | 32 |
For agents
markdown · JSON · MCP: product_card(name="ro31337/bigoposter")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem