If a problem has optimal substructure then... (check all that apply) ... it can be solved by a recursive algorithm. 3 **

[answerhappygod]

If A Problem Has Optimal Substructure Then Check All That Apply It Can Be Solved By A Recursive Algorithm 3 1 (31.59 KiB) Viewed 8 times

If a problem has optimal substructure then... (check all that apply) ... it can be solved by a recursive algorithm. 3 *** we can apply the Divide and Conquer algorithm design strategy to develop and algorithm for this problem. ... it cannot be solved by an iterative algorithm. ... recursive algorithms are always optimal. 1 point Which statement is most accurate? A self-reduction shows how the output to a problem can be reduced to the output of one of its sub-problems. A self-reduction shows how the output to a problem can be reduced to the input to the problem. A self-reduction shows how the output to a problem can be reduced to the output of another problem. A self-reduction shows how a problem can be reduced to a recursive algorithm. 0000