Computing the number of mergings with constraints
Information Processing Letters
Optimum combinations of sorting and merging
Journal of the ACM (JACM)
The Ford-Johnson Sorting Algorithm Is Not Optimal
Journal of the ACM (JACM)
Sorting 13 Elements Requires 34 Comparisons
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On merging N ordered elements with three elements
ACM SIGACT News
New Results in Minimum-Comparison Sorting
Algorithmica
Posets with seven linear extensions sortable by three comparisons
Information Processing Letters
Hi-index | 0.89 |
Using exhaustive computer search we show that sorting 15 elements requires 42 comparisons, and that for n