On the upper bound of the complexity of sorting

DOI10.1134/S0965542521020111zbMath1462.68032OpenAlexW3150971374MaRDI QIDQ2662813

Igor S. Sergeev

Publication date: 15 April 2021

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542521020111

zbMATH Keywords

complexitysortingpartial ordersimplexdecision tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Ford-Johnson algorithm still unbeaten for less than 47 elements
• Merging of 4 or 5 elements with n elements
• Finding the median
• QuickXsort: a fast sorting scheme in theory and practice
• Optimal merging of 2 elements with n elements
• Selecting the Median
• A Tournament Problem
• Improved average complexity for comparison-based sorting

This page was built for publication: On the upper bound of the complexity of sorting