The Ford-Johnson algorithm still unbeaten for less than 47 elements
type: Item
instance of: scholarly article
title: The Ford-Johnson algorithm still unbeaten for less than 47 elements
zbMATH Open document ID: 1185.68881
author: Marcin Peczarski
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 5664745
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: sorting
zbMATH Keywords: merging
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.09.001
OpenAlex ID: W2081463407
Wikidata QID: Q30040050
cites work: Computing the number of mergings with constraints
cites work: A Tournament Problem
cites work: Q5618383
cites work: Optimal merging of 2 elements with n elements
cites work: Q4349924
cites work: The Ford-Johnson Sorting Algorithm Is Not Optimal
cites work: Q4144789
cites work: Q4411410
cites work: New results in minimum-comparison sorting
cites work: Merging of 4 or 5 elements with n elements
cites work: On the Optimality of Linear Merge
cites work: Q5657656
DBLP publication ID: journals/ipl/Peczarski07
DOI: 10.1016/J.IPL.2006.09.001
description: scientific article; zbMATH DE number 5664745