Blazing Fast Merge with Loser Trees - Bryan Boreham, Grafana Labs

Both sorting and merging efficiently can be hard problems. Merging ordered sequences is a little bit easier, but still hard. Thankfully many hard problems in computer science have been well-studied. A good strategy for k-way merging is called Tournament Tree, or Loser Tree. Go didn’t have an implementation of that, so I made one.
In this talk, we will look at
Fundamentals and problems of k-way merges
How Go generics enable an efficient implementation
How profiling and benchmarks were used to tune the implementation and interface

[@ps-dn7ce]

I've worked with Bryan. Great Engineer. Best watch at 1.5 speed, that feature was not available during our townhalls ;-)