0xAX/go-algorithms resource
Algorithms and data structures for golang 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: 4456
- days_rel: n/a
- days_push: 1065
- n_releases_24m: 0
Adoption not part of the score
1950 stars · 346 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
A collection of classic algorithms and data structures implemented in Go, including sorting, searching, collections, and numerical algorithms. It serves primarily as an educational reference rather than a production library.
Use cases
- learn sorting algorithms in go
- go implementation of binary search
- study data structures like linked lists and binary trees
- reference for quicksort and merge sort in golang
- prepare for coding interviews with go examples
When to choose
- you want readable Go examples of classic algorithms for learning or teaching
- you need reference implementations to compare against your own code
When to avoid
- you need a production-grade, well-tested algorithm library with semver releases
- you need algorithms not covered here like graphs with weighted edges or advanced structures
Facets
learning-resource · maturity maintenance
developer-tools education programming-languages go algorithms data-structures sorting searching educational
1 source
- readme: https://github.com/0xAX/go-algorithms · fetched 2026-08-28 · 6dde778f3aa5
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| 0xAX/go-algorithms | main | 32 |
For agents
markdown · JSON · MCP: product_card(name="0xAX/go-algorithms")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem