Significant improvements to the Ford-Johnson algorithm for sorting
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.
scientific article; zbMATH DE number 3921994