What makes decrease-and-conquer algorithms better candidates for dynamic programming than divide-and-conquer algorithms

The definition including its situation in question is outlined throughout the overview section described.

Explanation:

Divide and Conquer:

By breaking the question across sub-problems, Divide and Conquer functions, iteratively conquering each sub-problem before integrating these approaches.

Dynamic Programming:

Dynamic programming seems to be a solution for addressing challenges with sub-problems that connect. Each sub-problem has only been solved the other day and the outcome of every other sub-problem becomes reserved for future comparisons in something like a table. Those other sub-solutions could be used to achieve the initial solution, although memorization becomes recognized as that of the strategy of preserving the comment section-problem solutions.

Here may be another distinction between divide as well as conquer as well as complex programming:

Divide and conquer:

Dynamic programming:

okay, so i know we just goofed around in that chat, but ive been like genuinly depressed, like medically depressed for almost 4 years now. i had my first panic attack when i was 8. i woke my mum up and told her i felt like i was in a dream. like i was a goldfish in a bowl, looking at all these things going on around me and feeling . tiny. wort hless. and i now am now 17 y/o. i still feel those emotions daily. life used to go by so quick.like every day i would wake up and just like want to go back to bed cause i always felt like i was in the wrong place. i guess looking back, i was in the wrong state of mind. i took a expensive like nice trip to whyoming with my grandfather and ha ted it. like idk why. i would have loved it now, but i found myself writing in a journal everyday because i would forget what happened the day before, couldnt remember what i ate for like the previous meal. just my memory left me for the week i was there. worst feeling ive ever experienced.