Minimize cost of recursive pairwise sums: how to prove the greedy solution works?
-
05-11-2019 - |
Question
The problem is in this other question.
Why does this always work? It's not clear to me how one would use induction.
For $n = 3$, a quick calculation shows it works, however, I don't think it generalizes well.
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange