Significant improvements to the Ford-Johnson algorithm for sorting

DOI10.1007/BF01934989zbMath0576.68049MaRDI QIDQ1064782

B. George

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

sorting by comparison

Mathematics Subject Classification ID

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

Related Items (3)

On partial sorting in restricted rounds ⋮ On the average case of MergeInsertion ⋮ Significant improvements to the Ford-Johnson algorithm for sorting

Cites Work

• Unnamed Item
• Significant improvements to the Ford-Johnson algorithm for sorting
• An improvement of the binary merge algorithm
• Significant Improvements to the Hwang-Lin Merging Algorithm
• The Ford-Johnson Sorting Algorithm Is Not Optimal
• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
• A Tournament Problem

This page was built for publication: Significant improvements to the Ford-Johnson algorithm for sorting