The sum of array products G1S1 G9S9 A(G1, G2, G3, G4)B(G4, G5) C(G5, G6)D(G6, G7,

Question:

The sum of array products


G1∈S1

···

G9∈S9 A(G1, G2, G3, G4)B(G4, G5)

× C(G5, G6)D(G6, G7, G8, G9)

can be evaluated as an iterated sum by the greedy algorithm. If all range sets Si have the same number of elements m > 2, then show that one greedy summation sequence is (5, 1, 2, 3, 4, 7, 8, 9, 6). Prove that the alternative nongreedy sequence (1, 2, 3, 4, 5, 7, 8, 9, 6) requires fewer arithmetic operations (additions plus multiplications) [18].

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: