go-loser

Loser Tree data structure, for fast k-way merge

APACHE-2.0 License

Stars

Ecosystems: Go

Package Rankings

Top 9.73% on Proxy.golang.org

Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci

[WIP] Implementation of HAT-trie in Go

A collection of useful, performant, and threadsafe Go datastructures.

BTree provides a simple, ordered, in-memory data structure for Go programs.

Algorithms and data structures for golang

𝙄𝙛 𝙮𝙤𝙪'𝙧𝙚 𝙣𝙚𝙬 𝙩𝙤 𝙂𝙤(𝙂𝙞𝙣/𝙂𝙊𝙍𝙈), 𝙝𝙚𝙧𝙚'𝙨 𝙖 𝙧𝙤𝙖𝙙𝙢𝙖𝙥 🛫

Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).

This is technically a B+Tree, but the btree name is easier on the tongoue :). Completely improvis...

Data Structures and Algorithms implementation in Go

A collection of generic data structures written in Go.

慕课 liuyubobobo「玩转数据结构」课程的 Go 语言实现版本

🔥LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 ...

Hands on exercises with real-life examples to study and practice Go concurrency patterns. Test-ca...