Consider the following steps:

S​1​: Characterize the structure of an optimal solution

S2​: Computer the value of an optimal solution in bottom-up fashion

Which of the step(s) is/are common to both dynamic programming and greedy algorithms?

1
Only S​1
2
Only S​2
3
both S1 and S2
4
neither S1 nor S2

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation