title: Difference between greedy and Dynamic and divide and conquer algorithms
body: <p>I want to know the difference between these three i know that in Divide and conquer and Dynamic algos the difference between these two is that both divides the broblem in small part but in D&amp;Q the the small parts of the problem are  dependent on each other whereas not the case with dynamic. but what about greedy ?</p>