SquareSort: a cache-oblivious sorting algorithm
Data Structures and Algorithms
2024-07-23 v1
Abstract
In this paper we consider sorting in the cache-oblivious model of Frigo, Leiserson, Prokop, and Ramachandran (1999). We introduce a new simple sorting algorithm in that model which has asymptotically optimal IO complexity , where is the instance size, size of the cache and size of a memory block. This is the same as the complexity of the best known cache-oblivious sorting algorithm FunnelSort.
Cite
@article{arxiv.2407.14801,
title = {SquareSort: a cache-oblivious sorting algorithm},
author = {Michal Koucký and Josef Matějka},
journal= {arXiv preprint arXiv:2407.14801},
year = {2024}
}