Anytime Sorting Algorithms (Extended Version)

Emma Caizergues, François Durand, Fabien Mathieu

This paper addresses the anytime sorting problem, aiming to develop algorithms providing tentative estimates of the sorted list at each execution step. Comparisons are treated as s…