  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
$O(\frac{n}{B} \log_{M/B} n)$, where $n$ is the instance size, $M$ size of the
cache and $B$ size of a memory block. This is the same as the complexity of the
best known cache-oblivious sorting algorithm FunnelSort.
