##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
K-way merge
Given sorted lists, merge them into one sorted list. Approaches:
Merge two at a time: merge first two, then merge result with third, etc. Time: where is total elements.
Min-heap: always pick the smallest among current heads. Time: . The heap approach is much faster when is large. The heap tracks the "frontier" of candidates.
