Significant improvements to the Ford-Johnson algorithm for sorting
type: Item
instance of: scholarly article
title: Significant improvements to the Ford-Johnson algorithm for sorting
zbMATH Open document ID: 0576.68049
DOI: 10.1007/BF01934989
author: B. George
published in: BIT
publication date: 1985-01-01T00:00:00Z
review text: The authors present a sorting by comparison algorithm and discuss its performances. The algorithm is an improvement of an algorithm proposed by \textit{G. K. Manache} [J. Assoc. Comput. Mach. 26, 441-456 (1979; Zbl 0404.68063)] as a more efficient version of the known Ford-Johnson sorting algorithm. Authors' contribution is based on a merging algorithm for two lists, proposed by \textit{C. Christen} [Improving the bounds on optimal merging, Proc. 19th Annual IEEE Conf. on the Foundations of Computer Sci., 259-266 (1978)]. The proofs for the stated results are not included in this paper.
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3921994
zbMATH Keywords: sorting by comparison
MaRDI profile type: Publication
cites work: A Tournament Problem
cites work: A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
cites work: Q4057549
cites work: An improvement of the binary merge algorithm
cites work: The Ford-Johnson Sorting Algorithm Is Not Optimal
cites work: Significant Improvements to the Hwang-Lin Merging Algorithm
description: scientific article; zbMATH DE number 3921994