We have discussed the divideandconquer polynomial multiplica
We have discussed the divide-and-conquer polynomial multiplication algorithm, where each polynomial is partitioned into the high half and lower half. What if we partition the polynomials according to the index is even or odd. Will the divide-and-conquer approach still work? Explain why or why not.
Solution
basically here we have 3 staps
1.divide the set
2.conquor them,that is solving these problems individul
3.finally combine these solutions to get a comined result.
so here dividing based on odd and even indexes will not matter because make 2 individual sets of odd ans even indexes.solve them individually and finally combine their result.ultimately we obtain the same thing.so it doesnt matter,how you divide
