0
Still curious? Ask our experts.
Chat with our AI personalities
Steve
Professor
FranAdd your answer:
Earn +20 pts
What are the difference between greedy algorithm and dynamic programing?
A greedy algorithm is similar to a dynamic programming algorithm, but the difference is that solutions to the subproblems do not have to be known at each stage; instead a "greedy" choice can be made of what looks best for the moment.
What is the similar property between dynamic programming and greedy approach?
Both are using Optimal substructure , that is if an optimal solution to the problem contains optimal solutions to the sub-problems
What is the difference between dynamic strength and static strength?
well the static energy is the strength that resides in your body when you're not moving but dynamic energy is that the one occurs when you moving like swimming
What is the difference between dynamic implementation and linked list implemention?
The size or length of the list. For static, the size is a constant, while the size of a dynamic list may change over time. The 7 weekdays is static (in size/length, though the content is static as well), while the questions and answers at answers.com are 2 dynamic lists (the sizes are not constants, although just growing)
Advantages of dynamic programming?
Dynamic programming enables you to develop sub solutions of a large program.the sub solutions are easier to maintain use and debug.And they possess overlapping also that means we can reuse them.these sub solutions are optimal solutions for the problem
