Greedy Algorithms8 sections · 316 units
Open in CourseQuiz: Two Properties
Test your understanding
Check Your Understanding
Which two properties must hold for greedy to work?
- A.Overlapping subproblems and memoization
- B.Divide and conquer with merge step
- C.Greedy choice property and optimal substructure
- D.Backtracking with pruning