TAOCP 5.3.2 Exercise 10

Working

taocpmathematicsalgorithmsvolume-3hard

Section 5.3.2: Minimum-Comparison Merging

Exercise 10. [33] [33] Prove that five elements can be merged with nine in at most twelve steps. [Hint: Experience with the adversary suggests first comparing $A_1:B_2$, then trying

Verified: no
Solve time: 4m14s

Working