theodesp / go-heaps

Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
MIT License
97 stars 29 forks source link

Add Soft Heap implementation #18

Open theodesp opened 6 years ago

theodesp commented 6 years ago

https://en.wikipedia.org/wiki/Soft_heap

iampeterbanjo commented 6 years ago

Would this require go benchmark tests to validate that it has amortized time its operations?

theodesp commented 6 years ago

Not yet but if you write them then all the better!