Recursive, and not dynamic programming
Merge sort is recursive, splits a problem into smaller versions of itself, and combines their answers. It is not dynamic programming.
Why not?
Merge sort is recursive, splits a problem into smaller versions of itself, and combines their answers. It is not dynamic programming.
Why not?