The following pages link to Efficient unbalanced merge-sort (Q2489231):
Displaying 6 items.
- On the complexity of min-max sorting networks (Q454886) (← links)
- Recursive merge sort with erroneous comparisons (Q642963) (← links)
- On embedding subclasses of height-balanced trees in hypercubes (Q1006750) (← links)
- Significant improvements to the Ford-Johnson algorithm for sorting (Q1064782) (← links)
- Bottom-up mergesort -- A detailed analysis (Q1899222) (← links)
- Sorting an array using the topological sort of a corresponding comparison graph (Q2207498) (← links)