Anytime Sorting Algorithms (Extended Version) - Archive ouverte HAL Access content directly
Conference Papers Year : 2024

Anytime Sorting Algorithms (Extended Version)

Abstract

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 steps, and the Spearman's footrule metric evaluates estimation accuracy. We propose a general approach for making any sorting algorithm anytime and introduce two new algorithms: multizip sort and Corsort. Simulations showcase the superior performance of both algorithms compared to existing methods. Multizip sort keeps a low global complexity, while Corsort produces intermediate estimates surpassing previous algorithms.
Fichier principal
Vignette du fichier
ijcai.pdf (375.47 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04571472 , version 1 (14-05-2024)

Identifiers

  • HAL Id : hal-04571472 , version 1

Cite

Emma Caizergues, François Durand, Fabien Mathieu. Anytime Sorting Algorithms (Extended Version). 33rd International Joint Conference on Artificial Intelligence (IJCAI 2024), Aug 2024, Jeju City, Jeju Island, South Korea. ⟨hal-04571472⟩
0 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More