Pages that link to "Item:Q4190150"
From MaRDI portal
The following pages link to The Ford-Johnson Sorting Algorithm Is Not Optimal (Q4190150):
Displayed 10 items.
- The Ford-Johnson algorithm still unbeaten for less than 47 elements (Q845913) (← links)
- A variant of the Ford-Johnson algorithm that is more space efficient (Q846008) (← links)
- Significant improvements to the Ford-Johnson algorithm for sorting (Q1064782) (← links)
- Merging of 4 or 5 elements with n elements (Q1157175) (← links)
- Some modified algorithms for Dijkstra's longest upsequence problem (Q1161300) (← links)
- On partial sorting in restricted rounds (Q2013879) (← links)
- Some Completeness Results on Decision Trees and Group Testing (Q3801062) (← links)
- On the average case of MergeInsertion (Q5918284) (← links)
- Improved average complexity for comparison-based sorting (Q5919334) (← links)
- Small Complexity Gaps for Comparison-Based Sorting (Q6163631) (← links)