Almost-sure asymptotic for the number of heaps inside a random sequence
Probability
2017-02-22 v1
Abstract
We study the minimum number of heaps required to sort a random sequence using a generalization of Istrate and Bonchis's algorithm (2015). In a previous paper, the authors proved that the expected number of heaps grows logarithmically. In this note, we improve on the previous result by establishing the almost-sure and L 1 convergence.
Keywords
Cite
@article{arxiv.1702.06444,
title = {Almost-sure asymptotic for the number of heaps inside a random sequence},
author = {Anne-Laure Basdevant and Arvind Singh},
journal= {arXiv preprint arXiv:1702.06444},
year = {2017}
}