A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data
[chapter]
2018
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX)
We empirically study sorting in the evolving data model. In this model, a sorting algorithm maintains an approximation to the sorted order of a list of data items while simultaneously, with each comparison made by the algorithm, an adversary randomly swaps the order of adjacent items in the true sorted order. Previous work studies only two versions of quicksort, and has a gap between the lower bound of Ω(n) and the best upper bound of O(n log log n). The experiments we perform in this paper
doi:10.1137/1.9781611975055.8
dblp:conf/alenex/VialDEGJ18
fatcat:s2p6qqfezfbbjh42ojg5fridku