Ask
Login
0
18kviews
Explain the advantages of dynamic programming . How it differs from divide and conquer
written 7.9 years ago by gravatar for satishmanje93 satishmanje93 • 250 modified 3.9 years ago by gravatar for pedsangini276 pedsangini276 • 4.8k

Subject: Analysis Of Algorithm

Topic: Dynamic Programming

Difficulty: High
analysis of algorithms
ADD COMMENT EDIT
1 Answer
0
434views
written 7.7 years ago by gravatar for satishmanje93 satishmanje93 • 250 •   modified 7.7 years ago

Dynamic Programming* In computer science, mathematics, management science, economics and bioinformatics, dynamic programming (also known as dynamic optimization) is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions. The next …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.