Consider the following statements about algorithms in a textbook: 1. All algorithms…

Written by

in

Consider the following statements about algorithms in a textbook: 1. All algorithms are either greedy or dynamic programming. 2. Some dynamic programming algorithms are used for optimization problems. Which conclusion can be logically drawn?

Comments

Leave a Reply

Your email address will not be published. Required fields are marked *

More posts