 Most of the analysis of this algorithm revolves around analyzing the space and cache miss complexity of the k-merger.The first important bound is that a k-merger can be fit in formula_38 space.To see this, we let formula_39 denote the space needed for a k-merger.