Cache Conscious Mergesort

• Partition problem into “tiles” that fit in the cache.

• Mergesort the tiles.

• Merge the tiles.

• Avoid copying by sorting in-place into groups of 2 or 4 depending on whether log2(n/4) is odd or even.

Previous slide

Next slide

Back to first slide

View graphic version