An efficient sorting algorithm for a sequence of kings in a tournament.

DOI10.1016/S0020-0190(01)00142-9zbMath1051.68052OpenAlexW2003662071WikidataQ126821035 ScholiaQ126821035MaRDI QIDQ1603402

Jie Wu, Li Sheng

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00142-9

zbMATH Keywords

Computational complexityTournamentKingSorting algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Applications of game theory (91A80)

Related Items (2)

ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES ⋮ Sorting a sequence of strong kings in a tournament

Cites Work

• Unnamed Item

This page was built for publication: An efficient sorting algorithm for a sequence of kings in a tournament.