Ask
Login
0
1.5kviews
Differentiate between greedy approach and dynamic programming.
written 7.9 years ago by gravatar for satishmanje93 satishmanje93 • 250 modified 3.9 years ago by gravatar for sagarkolekar sagarkolekar ★ 11k
analysis of algorithms
ADD COMMENT EDIT
1 Answer
0
24views
written 3.9 years ago by gravatar for Krishna_Agrawal Krishna_Agrawal • 2.7k •   modified 3.9 years ago
S.No. Greedy Approach Dynamic Programming
1. In Greedy, there is no such guarantee of getting optimal solution. In dynamic, it will generate an optimal solution using Principle of optimality.
2. More efficient as compared to a dynamic approach. Less efficient as compared to a greedy approach.
3. Generates a single …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.