easy5 pts · first answer countsdynamic-programmingdp-basics
Why merge sort is not DP
Merge sort splits an array into halves, sorts each, and merges them. Why is this not usually called dynamic programming?
Discussion 0
Join free to post in the discussion.
Related questions
- Signs that a problem suits DPBackend Developer
- What memoisation meansBackend Developer
- What tabulation meansBackend Developer
- Cost of plain recursive FibonacciBackend Developer
- Fibonacci after adding a cacheBackend Developer
- Recursion with no base caseBackend Developer
- Ways to climb five stairsBackend Developer
- Hidden memory cost of recursionBackend Developer