An idea from external sorting

• Merging of sorted arrays is I/O efficient. We can use the celebrated loser tree to merge the sets.

Previous slide

Next slide

Back to first slide

View graphic version