Expand description
Binary heap merger.
Structs
- Binary heap merger implementation. Merges multiple sorted inputs into a single sorted output. Time complexity is m * log(n) in worst case where m is the number of items, n is the number of chunks (inputs).