Robin Hood Sort, for uniform data

It’s a pure safe BTree that can be used to build your own special-purpose btree data structure

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.

⏱ The exponential backoff algorithm in Go