Data Structures
Fast priority queues in Golang: Hierarchical Heap
Hierarchical Heap is a very efficient Priority Queue O(log n/k) for large data sets.
Fast priority queues in Golang: Hierarchical Queue
Writing O(1) high performance data structures, in order to learn Go.
Bledea Georgescu Adrian © 2024