Draw the recursion tree for the merge-sort procedure on an array of 16 elements explain why memoization is ineffective in speeding up a good divide-and-conquer algorithm such as merge-sort?

  The MERGESORT algorithm performs atmost a single call to any pair of indices of the array that is being sorted. In otherwords, the subproblems do not overlap and therefo…re memoization will not improve the running time. otherwise........take the look at following: It does not have the Overlapping Subproblems property. (Not re-visiting subproblems.) Needs lot of space to store solutions of subproblems. Overlapping sub-problems property is as follows: We accidentally recalculate the same problem twice or more. (MORE)