Anytime Sorting Algorithms (Extended Version)

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Caizergues, Emma, Durand, François, Mathieu, Fabien
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929343377178624
author Caizergues, Emma
Durand, François
Mathieu, Fabien
author_facet Caizergues, Emma
Durand, François
Mathieu, Fabien
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2405_08564
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Anytime Sorting Algorithms (Extended Version)
Caizergues, Emma
Durand, François
Mathieu, Fabien
Data Structures and Algorithms
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.
title Anytime Sorting Algorithms (Extended Version)
topic Data Structures and Algorithms
url https://arxiv.org/abs/2405.08564