Consider the following greedy approach to the matrix-chainmultiplication problem: Whenever there are at least 3 matrices (π΄π... π΄π, π β π β₯ 2) remaining, always split the chain at π: (π΄π ...π΄π)(π΄π+1 ... π΄π), such that ππ is the smallest number among {ππ,... , ππβ1}. Prove that this greedy approach doesnβt always giveoptimal solution.
Please answer correctly. If you don't know, leave it forothers to solve. Incorrect answers will definitely bedownvoted.
Consider the following greedy approach to the matrix-chain multiplication problem: Whenever there are at least 3 matrice
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am