ua-nick/Data-Structures-and-Algorithms

Health v2 · maintenance only

Flags: no_releases

Adoption not part of the score

2770 stars · 335 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

A Go implementation of common data structures (linked lists, stacks, queues, binary trees, hash tables, tries) and classic searching and sorting algorithms. It is explicitly designed as reference code to copy and adapt rather than to import as a dependency.

Use cases

• learn how classic data structures are implemented in Go
• copy a merge sort or binary search implementation into my project
• study reference code for linked lists, stacks, and queues
• find a clean Go example of a hash table or trie
• compare implementations of searching and sorting algorithms
• prepare for coding interviews with readable algorithm code

When to choose

• you want readable, idiomatic Go source to copy into your own codebase
• you are learning or teaching data structures and algorithms
• you need a small algorithm snippet without pulling in a dependency

When to avoid

• you need a production-grade, battle-tested data structures library to import
• you require advanced structures like graphs, heaps, or balanced trees
• you expect frequent updates or long-term maintenance

Facets

library · maturity maintenance

parser developer-tools programming-languages tutorials go cross-platform data-structures sorting-algorithms searching-algorithms go educational copy-paste-friendly algorithms

Member repositories

For agents

markdown · JSON · MCP: product_card(name="ua-nick/Data-Structures-and-Algorithms")